/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/safe029_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-19 05:20:51,027 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-19 05:20:51,030 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-19 05:20:51,047 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-19 05:20:51,047 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-19 05:20:51,048 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-19 05:20:51,050 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-19 05:20:51,052 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-19 05:20:51,053 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-19 05:20:51,054 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-19 05:20:51,055 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-19 05:20:51,056 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-19 05:20:51,057 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-19 05:20:51,058 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-19 05:20:51,059 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-19 05:20:51,060 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-19 05:20:51,061 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-19 05:20:51,062 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-19 05:20:51,063 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-19 05:20:51,065 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-19 05:20:51,067 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-19 05:20:51,068 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-19 05:20:51,069 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-19 05:20:51,070 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-19 05:20:51,072 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-19 05:20:51,072 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-19 05:20:51,073 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-19 05:20:51,074 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-19 05:20:51,074 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-19 05:20:51,075 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-19 05:20:51,075 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-19 05:20:51,076 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-19 05:20:51,077 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-19 05:20:51,077 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-19 05:20:51,078 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-19 05:20:51,079 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-19 05:20:51,079 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-19 05:20:51,079 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-19 05:20:51,080 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-19 05:20:51,081 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-19 05:20:51,081 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-19 05:20:51,082 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-19 05:20:51,096 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-19 05:20:51,097 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-19 05:20:51,098 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-19 05:20:51,098 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-19 05:20:51,098 INFO L138 SettingsManager]: * Use SBE=true [2019-12-19 05:20:51,099 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-19 05:20:51,099 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-19 05:20:51,099 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-19 05:20:51,099 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-19 05:20:51,099 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-19 05:20:51,100 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-19 05:20:51,100 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-19 05:20:51,100 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-19 05:20:51,100 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-19 05:20:51,100 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-19 05:20:51,101 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-19 05:20:51,101 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-19 05:20:51,101 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-19 05:20:51,101 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-19 05:20:51,101 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-19 05:20:51,102 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-19 05:20:51,102 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 05:20:51,102 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-19 05:20:51,102 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-19 05:20:51,102 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-19 05:20:51,103 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-19 05:20:51,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-19 05:20:51,103 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-19 05:20:51,103 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-19 05:20:51,104 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-19 05:20:51,384 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-19 05:20:51,400 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-19 05:20:51,404 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-19 05:20:51,406 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-19 05:20:51,406 INFO L275 PluginConnector]: CDTParser initialized [2019-12-19 05:20:51,407 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_rmo.opt.i [2019-12-19 05:20:51,469 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d89882f55/fc50e513a85a4bedb5bb8600fdb26911/FLAG881840e32 [2019-12-19 05:20:51,994 INFO L306 CDTParser]: Found 1 translation units. [2019-12-19 05:20:51,995 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_rmo.opt.i [2019-12-19 05:20:52,032 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d89882f55/fc50e513a85a4bedb5bb8600fdb26911/FLAG881840e32 [2019-12-19 05:20:52,284 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d89882f55/fc50e513a85a4bedb5bb8600fdb26911 [2019-12-19 05:20:52,295 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-19 05:20:52,297 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-19 05:20:52,298 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-19 05:20:52,299 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-19 05:20:52,302 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-19 05:20:52,303 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 05:20:52" (1/1) ... [2019-12-19 05:20:52,306 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f8d3866 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:20:52, skipping insertion in model container [2019-12-19 05:20:52,306 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 05:20:52" (1/1) ... [2019-12-19 05:20:52,313 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-19 05:20:52,375 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-19 05:20:52,891 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 05:20:52,914 INFO L203 MainTranslator]: Completed pre-run [2019-12-19 05:20:53,014 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 05:20:53,088 INFO L208 MainTranslator]: Completed translation [2019-12-19 05:20:53,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:20:53 WrapperNode [2019-12-19 05:20:53,088 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-19 05:20:53,089 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-19 05:20:53,089 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-19 05:20:53,089 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-19 05:20:53,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:20:53" (1/1) ... [2019-12-19 05:20:53,119 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:20:53" (1/1) ... [2019-12-19 05:20:53,159 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-19 05:20:53,160 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-19 05:20:53,160 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-19 05:20:53,160 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-19 05:20:53,170 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:20:53" (1/1) ... [2019-12-19 05:20:53,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:20:53" (1/1) ... [2019-12-19 05:20:53,176 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:20:53" (1/1) ... [2019-12-19 05:20:53,176 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:20:53" (1/1) ... [2019-12-19 05:20:53,186 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:20:53" (1/1) ... [2019-12-19 05:20:53,191 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:20:53" (1/1) ... [2019-12-19 05:20:53,195 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:20:53" (1/1) ... [2019-12-19 05:20:53,200 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-19 05:20:53,200 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-19 05:20:53,201 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-19 05:20:53,201 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-19 05:20:53,202 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:20:53" (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-19 05:20:53,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-19 05:20:53,276 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-19 05:20:53,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-19 05:20:53,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-19 05:20:53,277 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-19 05:20:53,277 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-19 05:20:53,277 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-19 05:20:53,278 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-19 05:20:53,278 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-19 05:20:53,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-19 05:20:53,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-19 05:20:53,280 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-19 05:20:54,027 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-19 05:20:54,027 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-19 05:20:54,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:20:54 BoogieIcfgContainer [2019-12-19 05:20:54,029 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-19 05:20:54,032 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-19 05:20:54,032 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-19 05:20:54,036 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-19 05:20:54,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 05:20:52" (1/3) ... [2019-12-19 05:20:54,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44ad8659 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 05:20:54, skipping insertion in model container [2019-12-19 05:20:54,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:20:53" (2/3) ... [2019-12-19 05:20:54,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44ad8659 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 05:20:54, skipping insertion in model container [2019-12-19 05:20:54,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:20:54" (3/3) ... [2019-12-19 05:20:54,044 INFO L109 eAbstractionObserver]: Analyzing ICFG safe029_rmo.opt.i [2019-12-19 05:20:54,056 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-19 05:20:54,056 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-19 05:20:54,064 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-19 05:20:54,064 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-19 05:20:54,104 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,105 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,106 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,118 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,118 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,119 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,119 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,119 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,143 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,143 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,148 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,148 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,149 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,168 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-19 05:20:54,191 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-19 05:20:54,191 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-19 05:20:54,191 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-19 05:20:54,192 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-19 05:20:54,192 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-19 05:20:54,192 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-19 05:20:54,192 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-19 05:20:54,192 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-19 05:20:54,212 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 145 places, 179 transitions [2019-12-19 05:20:55,556 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22493 states. [2019-12-19 05:20:55,559 INFO L276 IsEmpty]: Start isEmpty. Operand 22493 states. [2019-12-19 05:20:55,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-19 05:20:55,569 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:55,570 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] [2019-12-19 05:20:55,571 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:55,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:55,578 INFO L82 PathProgramCache]: Analyzing trace with hash -2054349026, now seen corresponding path program 1 times [2019-12-19 05:20:55,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:55,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393480446] [2019-12-19 05:20:55,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:55,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:55,932 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-19 05:20:55,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393480446] [2019-12-19 05:20:55,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:55,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 05:20:55,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110274499] [2019-12-19 05:20:55,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 05:20:55,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:55,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 05:20:55,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 05:20:55,960 INFO L87 Difference]: Start difference. First operand 22493 states. Second operand 4 states. [2019-12-19 05:20:56,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:56,598 INFO L93 Difference]: Finished difference Result 23445 states and 91746 transitions. [2019-12-19 05:20:56,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 05:20:56,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-12-19 05:20:56,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:56,862 INFO L225 Difference]: With dead ends: 23445 [2019-12-19 05:20:56,863 INFO L226 Difference]: Without dead ends: 21269 [2019-12-19 05:20:56,866 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-19 05:20:58,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21269 states. [2019-12-19 05:20:58,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21269 to 21269. [2019-12-19 05:20:58,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21269 states. [2019-12-19 05:20:58,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21269 states to 21269 states and 83770 transitions. [2019-12-19 05:20:58,912 INFO L78 Accepts]: Start accepts. Automaton has 21269 states and 83770 transitions. Word has length 36 [2019-12-19 05:20:58,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:58,912 INFO L462 AbstractCegarLoop]: Abstraction has 21269 states and 83770 transitions. [2019-12-19 05:20:58,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 05:20:58,913 INFO L276 IsEmpty]: Start isEmpty. Operand 21269 states and 83770 transitions. [2019-12-19 05:20:58,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-19 05:20:58,918 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:58,919 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] [2019-12-19 05:20:58,919 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:58,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:58,920 INFO L82 PathProgramCache]: Analyzing trace with hash 99870175, now seen corresponding path program 1 times [2019-12-19 05:20:58,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:58,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201760483] [2019-12-19 05:20:58,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:58,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:59,045 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-19 05:20:59,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201760483] [2019-12-19 05:20:59,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:59,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:20:59,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919884453] [2019-12-19 05:20:59,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:20:59,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:59,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:20:59,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:20:59,051 INFO L87 Difference]: Start difference. First operand 21269 states and 83770 transitions. Second operand 5 states. [2019-12-19 05:21:00,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:00,453 INFO L93 Difference]: Finished difference Result 34703 states and 129062 transitions. [2019-12-19 05:21:00,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:21:00,454 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-19 05:21:00,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:00,618 INFO L225 Difference]: With dead ends: 34703 [2019-12-19 05:21:00,619 INFO L226 Difference]: Without dead ends: 34559 [2019-12-19 05:21:00,619 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-19 05:21:00,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34559 states. [2019-12-19 05:21:02,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34559 to 33059. [2019-12-19 05:21:02,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33059 states. [2019-12-19 05:21:03,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33059 states to 33059 states and 123950 transitions. [2019-12-19 05:21:03,008 INFO L78 Accepts]: Start accepts. Automaton has 33059 states and 123950 transitions. Word has length 43 [2019-12-19 05:21:03,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:03,009 INFO L462 AbstractCegarLoop]: Abstraction has 33059 states and 123950 transitions. [2019-12-19 05:21:03,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:21:03,010 INFO L276 IsEmpty]: Start isEmpty. Operand 33059 states and 123950 transitions. [2019-12-19 05:21:03,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-19 05:21:03,014 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:03,014 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-19 05:21:03,015 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:03,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:03,015 INFO L82 PathProgramCache]: Analyzing trace with hash 268512672, now seen corresponding path program 1 times [2019-12-19 05:21:03,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:03,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338460313] [2019-12-19 05:21:03,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:03,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:03,149 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-19 05:21:03,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338460313] [2019-12-19 05:21:03,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:03,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:21:03,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618136470] [2019-12-19 05:21:03,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:21:03,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:03,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:21:03,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:21:03,153 INFO L87 Difference]: Start difference. First operand 33059 states and 123950 transitions. Second operand 5 states. [2019-12-19 05:21:03,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:03,750 INFO L93 Difference]: Finished difference Result 40211 states and 148619 transitions. [2019-12-19 05:21:03,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:21:03,751 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-19 05:21:03,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:04,033 INFO L225 Difference]: With dead ends: 40211 [2019-12-19 05:21:04,033 INFO L226 Difference]: Without dead ends: 40051 [2019-12-19 05:21:04,034 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-19 05:21:05,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40051 states. [2019-12-19 05:21:06,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40051 to 34632. [2019-12-19 05:21:06,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34632 states. [2019-12-19 05:21:06,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34632 states to 34632 states and 129246 transitions. [2019-12-19 05:21:06,617 INFO L78 Accepts]: Start accepts. Automaton has 34632 states and 129246 transitions. Word has length 44 [2019-12-19 05:21:06,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:06,617 INFO L462 AbstractCegarLoop]: Abstraction has 34632 states and 129246 transitions. [2019-12-19 05:21:06,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:21:06,617 INFO L276 IsEmpty]: Start isEmpty. Operand 34632 states and 129246 transitions. [2019-12-19 05:21:06,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-19 05:21:06,629 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:06,630 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] [2019-12-19 05:21:06,630 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:06,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:06,630 INFO L82 PathProgramCache]: Analyzing trace with hash 2144969569, now seen corresponding path program 1 times [2019-12-19 05:21:06,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:06,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386556560] [2019-12-19 05:21:06,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:06,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:06,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-19 05:21:06,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386556560] [2019-12-19 05:21:06,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:06,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:21:06,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939456284] [2019-12-19 05:21:06,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:21:06,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:06,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:21:06,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:21:06,959 INFO L87 Difference]: Start difference. First operand 34632 states and 129246 transitions. Second operand 6 states. [2019-12-19 05:21:07,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:07,958 INFO L93 Difference]: Finished difference Result 45660 states and 166140 transitions. [2019-12-19 05:21:07,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 05:21:07,964 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-12-19 05:21:07,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:08,103 INFO L225 Difference]: With dead ends: 45660 [2019-12-19 05:21:08,103 INFO L226 Difference]: Without dead ends: 45516 [2019-12-19 05:21:08,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-12-19 05:21:08,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45516 states. [2019-12-19 05:21:10,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45516 to 33595. [2019-12-19 05:21:10,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33595 states. [2019-12-19 05:21:10,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33595 states to 33595 states and 125401 transitions. [2019-12-19 05:21:10,561 INFO L78 Accepts]: Start accepts. Automaton has 33595 states and 125401 transitions. Word has length 51 [2019-12-19 05:21:10,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:10,562 INFO L462 AbstractCegarLoop]: Abstraction has 33595 states and 125401 transitions. [2019-12-19 05:21:10,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:21:10,562 INFO L276 IsEmpty]: Start isEmpty. Operand 33595 states and 125401 transitions. [2019-12-19 05:21:10,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-19 05:21:10,596 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:10,596 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] [2019-12-19 05:21:10,596 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:10,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:10,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1490455740, now seen corresponding path program 1 times [2019-12-19 05:21:10,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:10,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904401486] [2019-12-19 05:21:10,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:10,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:10,688 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-19 05:21:10,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904401486] [2019-12-19 05:21:10,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:10,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:21:10,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43822801] [2019-12-19 05:21:10,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:21:10,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:10,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:21:10,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:21:10,691 INFO L87 Difference]: Start difference. First operand 33595 states and 125401 transitions. Second operand 6 states. [2019-12-19 05:21:11,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:11,720 INFO L93 Difference]: Finished difference Result 46067 states and 167834 transitions. [2019-12-19 05:21:11,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-19 05:21:11,720 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-19 05:21:11,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:11,822 INFO L225 Difference]: With dead ends: 46067 [2019-12-19 05:21:11,823 INFO L226 Difference]: Without dead ends: 45827 [2019-12-19 05:21:11,823 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-19 05:21:12,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45827 states. [2019-12-19 05:21:14,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45827 to 39956. [2019-12-19 05:21:14,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39956 states. [2019-12-19 05:21:14,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39956 states to 39956 states and 147325 transitions. [2019-12-19 05:21:14,572 INFO L78 Accepts]: Start accepts. Automaton has 39956 states and 147325 transitions. Word has length 58 [2019-12-19 05:21:14,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:14,572 INFO L462 AbstractCegarLoop]: Abstraction has 39956 states and 147325 transitions. [2019-12-19 05:21:14,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:21:14,572 INFO L276 IsEmpty]: Start isEmpty. Operand 39956 states and 147325 transitions. [2019-12-19 05:21:14,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-19 05:21:14,607 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:14,607 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] [2019-12-19 05:21:14,607 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:14,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:14,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1015725706, now seen corresponding path program 1 times [2019-12-19 05:21:14,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:14,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697056498] [2019-12-19 05:21:14,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:14,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:14,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 05:21:14,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697056498] [2019-12-19 05:21:14,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:14,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 05:21:14,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215015454] [2019-12-19 05:21:14,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 05:21:14,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:14,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 05:21:14,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 05:21:14,671 INFO L87 Difference]: Start difference. First operand 39956 states and 147325 transitions. Second operand 3 states. [2019-12-19 05:21:14,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:14,931 INFO L93 Difference]: Finished difference Result 50254 states and 182160 transitions. [2019-12-19 05:21:14,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 05:21:14,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-12-19 05:21:14,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:15,036 INFO L225 Difference]: With dead ends: 50254 [2019-12-19 05:21:15,036 INFO L226 Difference]: Without dead ends: 50254 [2019-12-19 05:21:15,037 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-19 05:21:15,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50254 states. [2019-12-19 05:21:16,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50254 to 43886. [2019-12-19 05:21:16,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43886 states. [2019-12-19 05:21:16,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43886 states to 43886 states and 160763 transitions. [2019-12-19 05:21:16,155 INFO L78 Accepts]: Start accepts. Automaton has 43886 states and 160763 transitions. Word has length 60 [2019-12-19 05:21:16,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:16,155 INFO L462 AbstractCegarLoop]: Abstraction has 43886 states and 160763 transitions. [2019-12-19 05:21:16,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 05:21:16,155 INFO L276 IsEmpty]: Start isEmpty. Operand 43886 states and 160763 transitions. [2019-12-19 05:21:16,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-19 05:21:16,191 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:16,191 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] [2019-12-19 05:21:16,191 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:16,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:16,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1067966230, now seen corresponding path program 1 times [2019-12-19 05:21:16,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:16,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980384335] [2019-12-19 05:21:16,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:16,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:16,285 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-19 05:21:16,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980384335] [2019-12-19 05:21:16,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:16,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 05:21:16,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499355725] [2019-12-19 05:21:16,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 05:21:16,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:16,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 05:21:16,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:21:16,287 INFO L87 Difference]: Start difference. First operand 43886 states and 160763 transitions. Second operand 7 states. [2019-12-19 05:21:17,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:17,267 INFO L93 Difference]: Finished difference Result 55882 states and 200497 transitions. [2019-12-19 05:21:17,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-19 05:21:17,268 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-19 05:21:17,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:17,874 INFO L225 Difference]: With dead ends: 55882 [2019-12-19 05:21:17,875 INFO L226 Difference]: Without dead ends: 55642 [2019-12-19 05:21:17,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-12-19 05:21:18,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55642 states. [2019-12-19 05:21:18,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55642 to 45112. [2019-12-19 05:21:18,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45112 states. [2019-12-19 05:21:18,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45112 states to 45112 states and 164930 transitions. [2019-12-19 05:21:18,751 INFO L78 Accepts]: Start accepts. Automaton has 45112 states and 164930 transitions. Word has length 64 [2019-12-19 05:21:18,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:18,752 INFO L462 AbstractCegarLoop]: Abstraction has 45112 states and 164930 transitions. [2019-12-19 05:21:18,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 05:21:18,752 INFO L276 IsEmpty]: Start isEmpty. Operand 45112 states and 164930 transitions. [2019-12-19 05:21:20,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-19 05:21:20,772 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:20,772 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-19 05:21:20,773 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:20,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:20,773 INFO L82 PathProgramCache]: Analyzing trace with hash -2097396923, now seen corresponding path program 1 times [2019-12-19 05:21:20,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:20,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727588372] [2019-12-19 05:21:20,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:20,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:20,893 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-19 05:21:20,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727588372] [2019-12-19 05:21:20,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:20,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 05:21:20,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139286521] [2019-12-19 05:21:20,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 05:21:20,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:20,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 05:21:20,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:21:20,897 INFO L87 Difference]: Start difference. First operand 45112 states and 164930 transitions. Second operand 7 states. [2019-12-19 05:21:22,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:22,137 INFO L93 Difference]: Finished difference Result 55096 states and 197674 transitions. [2019-12-19 05:21:22,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-19 05:21:22,137 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-19 05:21:22,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:22,256 INFO L225 Difference]: With dead ends: 55096 [2019-12-19 05:21:22,257 INFO L226 Difference]: Without dead ends: 54896 [2019-12-19 05:21:22,257 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-19 05:21:22,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54896 states. [2019-12-19 05:21:23,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54896 to 45990. [2019-12-19 05:21:23,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45990 states. [2019-12-19 05:21:23,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45990 states to 45990 states and 167801 transitions. [2019-12-19 05:21:23,352 INFO L78 Accepts]: Start accepts. Automaton has 45990 states and 167801 transitions. Word has length 65 [2019-12-19 05:21:23,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:23,352 INFO L462 AbstractCegarLoop]: Abstraction has 45990 states and 167801 transitions. [2019-12-19 05:21:23,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 05:21:23,352 INFO L276 IsEmpty]: Start isEmpty. Operand 45990 states and 167801 transitions. [2019-12-19 05:21:23,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 05:21:23,388 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:23,388 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] [2019-12-19 05:21:23,388 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:23,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:23,389 INFO L82 PathProgramCache]: Analyzing trace with hash 823868575, now seen corresponding path program 1 times [2019-12-19 05:21:23,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:23,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725478031] [2019-12-19 05:21:23,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:23,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:23,503 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-19 05:21:23,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725478031] [2019-12-19 05:21:23,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:23,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:21:23,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455914651] [2019-12-19 05:21:23,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:21:23,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:23,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:21:23,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:21:23,505 INFO L87 Difference]: Start difference. First operand 45990 states and 167801 transitions. Second operand 6 states. [2019-12-19 05:21:24,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:24,302 INFO L93 Difference]: Finished difference Result 65550 states and 237328 transitions. [2019-12-19 05:21:24,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:21:24,302 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-19 05:21:24,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:24,445 INFO L225 Difference]: With dead ends: 65550 [2019-12-19 05:21:24,445 INFO L226 Difference]: Without dead ends: 64906 [2019-12-19 05:21:24,446 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-19 05:21:25,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64906 states. [2019-12-19 05:21:25,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64906 to 56040. [2019-12-19 05:21:25,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56040 states. [2019-12-19 05:21:25,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56040 states to 56040 states and 204331 transitions. [2019-12-19 05:21:25,933 INFO L78 Accepts]: Start accepts. Automaton has 56040 states and 204331 transitions. Word has length 67 [2019-12-19 05:21:25,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:25,933 INFO L462 AbstractCegarLoop]: Abstraction has 56040 states and 204331 transitions. [2019-12-19 05:21:25,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:21:25,933 INFO L276 IsEmpty]: Start isEmpty. Operand 56040 states and 204331 transitions. [2019-12-19 05:21:25,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 05:21:25,985 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:25,985 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] [2019-12-19 05:21:25,986 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:25,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:25,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1785482592, now seen corresponding path program 1 times [2019-12-19 05:21:25,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:25,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212070677] [2019-12-19 05:21:25,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:26,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:26,112 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-19 05:21:26,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212070677] [2019-12-19 05:21:26,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:26,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 05:21:26,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272056951] [2019-12-19 05:21:26,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 05:21:26,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:26,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 05:21:26,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:21:26,114 INFO L87 Difference]: Start difference. First operand 56040 states and 204331 transitions. Second operand 7 states. [2019-12-19 05:21:27,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:27,574 INFO L93 Difference]: Finished difference Result 83028 states and 292759 transitions. [2019-12-19 05:21:27,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 05:21:27,575 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-19 05:21:27,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:27,761 INFO L225 Difference]: With dead ends: 83028 [2019-12-19 05:21:27,762 INFO L226 Difference]: Without dead ends: 83028 [2019-12-19 05:21:27,762 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-19 05:21:28,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83028 states. [2019-12-19 05:21:29,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83028 to 76077. [2019-12-19 05:21:29,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76077 states. [2019-12-19 05:21:29,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76077 states to 76077 states and 270626 transitions. [2019-12-19 05:21:29,652 INFO L78 Accepts]: Start accepts. Automaton has 76077 states and 270626 transitions. Word has length 67 [2019-12-19 05:21:29,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:29,653 INFO L462 AbstractCegarLoop]: Abstraction has 76077 states and 270626 transitions. [2019-12-19 05:21:29,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 05:21:29,653 INFO L276 IsEmpty]: Start isEmpty. Operand 76077 states and 270626 transitions. [2019-12-19 05:21:29,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 05:21:29,733 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:29,733 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] [2019-12-19 05:21:29,733 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:29,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:29,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1264720223, now seen corresponding path program 1 times [2019-12-19 05:21:29,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:29,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864590303] [2019-12-19 05:21:29,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:29,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:29,810 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-19 05:21:29,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864590303] [2019-12-19 05:21:29,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:29,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 05:21:29,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365886314] [2019-12-19 05:21:29,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 05:21:29,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:29,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 05:21:29,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 05:21:29,813 INFO L87 Difference]: Start difference. First operand 76077 states and 270626 transitions. Second operand 4 states. [2019-12-19 05:21:29,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:29,918 INFO L93 Difference]: Finished difference Result 17222 states and 54504 transitions. [2019-12-19 05:21:29,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 05:21:29,919 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-19 05:21:29,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:29,956 INFO L225 Difference]: With dead ends: 17222 [2019-12-19 05:21:29,956 INFO L226 Difference]: Without dead ends: 16744 [2019-12-19 05:21:29,957 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-19 05:21:30,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16744 states. [2019-12-19 05:21:30,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16744 to 16732. [2019-12-19 05:21:30,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16732 states. [2019-12-19 05:21:30,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16732 states to 16732 states and 52999 transitions. [2019-12-19 05:21:30,206 INFO L78 Accepts]: Start accepts. Automaton has 16732 states and 52999 transitions. Word has length 67 [2019-12-19 05:21:30,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:30,206 INFO L462 AbstractCegarLoop]: Abstraction has 16732 states and 52999 transitions. [2019-12-19 05:21:30,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 05:21:30,206 INFO L276 IsEmpty]: Start isEmpty. Operand 16732 states and 52999 transitions. [2019-12-19 05:21:30,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-19 05:21:30,218 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:30,218 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] [2019-12-19 05:21:30,218 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:30,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:30,219 INFO L82 PathProgramCache]: Analyzing trace with hash -357405743, now seen corresponding path program 1 times [2019-12-19 05:21:30,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:30,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738369125] [2019-12-19 05:21:30,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:30,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:30,282 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-19 05:21:30,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738369125] [2019-12-19 05:21:30,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:30,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 05:21:30,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142431700] [2019-12-19 05:21:30,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 05:21:30,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:30,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 05:21:30,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 05:21:30,284 INFO L87 Difference]: Start difference. First operand 16732 states and 52999 transitions. Second operand 4 states. [2019-12-19 05:21:30,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:30,532 INFO L93 Difference]: Finished difference Result 22096 states and 69080 transitions. [2019-12-19 05:21:30,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 05:21:30,533 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-12-19 05:21:30,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:30,566 INFO L225 Difference]: With dead ends: 22096 [2019-12-19 05:21:30,567 INFO L226 Difference]: Without dead ends: 22096 [2019-12-19 05:21:30,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-19 05:21:30,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22096 states. [2019-12-19 05:21:30,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22096 to 17608. [2019-12-19 05:21:30,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17608 states. [2019-12-19 05:21:30,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17608 states to 17608 states and 55558 transitions. [2019-12-19 05:21:30,975 INFO L78 Accepts]: Start accepts. Automaton has 17608 states and 55558 transitions. Word has length 77 [2019-12-19 05:21:30,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:30,976 INFO L462 AbstractCegarLoop]: Abstraction has 17608 states and 55558 transitions. [2019-12-19 05:21:30,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 05:21:30,976 INFO L276 IsEmpty]: Start isEmpty. Operand 17608 states and 55558 transitions. [2019-12-19 05:21:30,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-19 05:21:30,989 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:30,989 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] [2019-12-19 05:21:30,989 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:30,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:30,990 INFO L82 PathProgramCache]: Analyzing trace with hash -612142288, now seen corresponding path program 1 times [2019-12-19 05:21:30,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:30,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848006457] [2019-12-19 05:21:30,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:31,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:31,080 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-19 05:21:31,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848006457] [2019-12-19 05:21:31,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:31,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 05:21:31,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863371736] [2019-12-19 05:21:31,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 05:21:31,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:31,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 05:21:31,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-19 05:21:31,083 INFO L87 Difference]: Start difference. First operand 17608 states and 55558 transitions. Second operand 8 states. [2019-12-19 05:21:32,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:32,266 INFO L93 Difference]: Finished difference Result 19702 states and 61634 transitions. [2019-12-19 05:21:32,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-19 05:21:32,267 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 77 [2019-12-19 05:21:32,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:32,296 INFO L225 Difference]: With dead ends: 19702 [2019-12-19 05:21:32,296 INFO L226 Difference]: Without dead ends: 19654 [2019-12-19 05:21:32,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2019-12-19 05:21:32,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19654 states. [2019-12-19 05:21:32,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19654 to 15526. [2019-12-19 05:21:32,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15526 states. [2019-12-19 05:21:32,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15526 states to 15526 states and 49292 transitions. [2019-12-19 05:21:32,537 INFO L78 Accepts]: Start accepts. Automaton has 15526 states and 49292 transitions. Word has length 77 [2019-12-19 05:21:32,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:32,538 INFO L462 AbstractCegarLoop]: Abstraction has 15526 states and 49292 transitions. [2019-12-19 05:21:32,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 05:21:32,538 INFO L276 IsEmpty]: Start isEmpty. Operand 15526 states and 49292 transitions. [2019-12-19 05:21:32,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-19 05:21:32,557 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:32,557 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-19 05:21:32,557 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:32,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:32,558 INFO L82 PathProgramCache]: Analyzing trace with hash -2124522827, now seen corresponding path program 1 times [2019-12-19 05:21:32,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:32,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944246410] [2019-12-19 05:21:32,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:32,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:32,598 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-19 05:21:32,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944246410] [2019-12-19 05:21:32,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:32,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 05:21:32,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603584936] [2019-12-19 05:21:32,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 05:21:32,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:32,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 05:21:32,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 05:21:32,600 INFO L87 Difference]: Start difference. First operand 15526 states and 49292 transitions. Second operand 3 states. [2019-12-19 05:21:32,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:32,839 INFO L93 Difference]: Finished difference Result 16790 states and 53005 transitions. [2019-12-19 05:21:32,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 05:21:32,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-12-19 05:21:32,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:32,864 INFO L225 Difference]: With dead ends: 16790 [2019-12-19 05:21:32,865 INFO L226 Difference]: Without dead ends: 16790 [2019-12-19 05:21:32,865 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-19 05:21:32,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16790 states. [2019-12-19 05:21:33,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16790 to 16142. [2019-12-19 05:21:33,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16142 states. [2019-12-19 05:21:33,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16142 states to 16142 states and 51106 transitions. [2019-12-19 05:21:33,092 INFO L78 Accepts]: Start accepts. Automaton has 16142 states and 51106 transitions. Word has length 78 [2019-12-19 05:21:33,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:33,092 INFO L462 AbstractCegarLoop]: Abstraction has 16142 states and 51106 transitions. [2019-12-19 05:21:33,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 05:21:33,092 INFO L276 IsEmpty]: Start isEmpty. Operand 16142 states and 51106 transitions. [2019-12-19 05:21:33,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-19 05:21:33,106 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:33,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] [2019-12-19 05:21:33,107 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:33,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:33,107 INFO L82 PathProgramCache]: Analyzing trace with hash 2047654897, now seen corresponding path program 1 times [2019-12-19 05:21:33,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:33,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434298572] [2019-12-19 05:21:33,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:33,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:33,174 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-19 05:21:33,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434298572] [2019-12-19 05:21:33,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:33,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 05:21:33,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456785371] [2019-12-19 05:21:33,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 05:21:33,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:33,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 05:21:33,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 05:21:33,176 INFO L87 Difference]: Start difference. First operand 16142 states and 51106 transitions. Second operand 4 states. [2019-12-19 05:21:33,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:33,549 INFO L93 Difference]: Finished difference Result 19270 states and 60152 transitions. [2019-12-19 05:21:33,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 05:21:33,549 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-12-19 05:21:33,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:33,589 INFO L225 Difference]: With dead ends: 19270 [2019-12-19 05:21:33,590 INFO L226 Difference]: Without dead ends: 19270 [2019-12-19 05:21:33,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 05:21:33,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19270 states. [2019-12-19 05:21:33,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19270 to 18247. [2019-12-19 05:21:33,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18247 states. [2019-12-19 05:21:33,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18247 states to 18247 states and 57268 transitions. [2019-12-19 05:21:33,986 INFO L78 Accepts]: Start accepts. Automaton has 18247 states and 57268 transitions. Word has length 79 [2019-12-19 05:21:33,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:33,986 INFO L462 AbstractCegarLoop]: Abstraction has 18247 states and 57268 transitions. [2019-12-19 05:21:33,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 05:21:33,987 INFO L276 IsEmpty]: Start isEmpty. Operand 18247 states and 57268 transitions. [2019-12-19 05:21:34,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-19 05:21:34,002 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:34,003 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] [2019-12-19 05:21:34,003 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:34,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:34,003 INFO L82 PathProgramCache]: Analyzing trace with hash 111994610, now seen corresponding path program 1 times [2019-12-19 05:21:34,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:34,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016104130] [2019-12-19 05:21:34,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:34,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:34,054 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-19 05:21:34,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016104130] [2019-12-19 05:21:34,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:34,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 05:21:34,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582162969] [2019-12-19 05:21:34,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 05:21:34,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:34,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 05:21:34,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 05:21:34,059 INFO L87 Difference]: Start difference. First operand 18247 states and 57268 transitions. Second operand 3 states. [2019-12-19 05:21:34,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:34,289 INFO L93 Difference]: Finished difference Result 19578 states and 61167 transitions. [2019-12-19 05:21:34,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 05:21:34,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-12-19 05:21:34,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:34,320 INFO L225 Difference]: With dead ends: 19578 [2019-12-19 05:21:34,320 INFO L226 Difference]: Without dead ends: 19578 [2019-12-19 05:21:34,320 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-19 05:21:34,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19578 states. [2019-12-19 05:21:34,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19578 to 18919. [2019-12-19 05:21:34,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18919 states. [2019-12-19 05:21:34,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18919 states to 18919 states and 59232 transitions. [2019-12-19 05:21:34,576 INFO L78 Accepts]: Start accepts. Automaton has 18919 states and 59232 transitions. Word has length 79 [2019-12-19 05:21:34,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:34,577 INFO L462 AbstractCegarLoop]: Abstraction has 18919 states and 59232 transitions. [2019-12-19 05:21:34,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 05:21:34,577 INFO L276 IsEmpty]: Start isEmpty. Operand 18919 states and 59232 transitions. [2019-12-19 05:21:34,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 05:21:34,592 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:34,593 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] [2019-12-19 05:21:34,593 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:34,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:34,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1909076484, now seen corresponding path program 1 times [2019-12-19 05:21:34,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:34,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028493521] [2019-12-19 05:21:34,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:34,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:34,714 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-19 05:21:34,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028493521] [2019-12-19 05:21:34,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:34,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:21:34,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075915884] [2019-12-19 05:21:34,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:21:34,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:34,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:21:34,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:21:34,716 INFO L87 Difference]: Start difference. First operand 18919 states and 59232 transitions. Second operand 6 states. [2019-12-19 05:21:35,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:35,450 INFO L93 Difference]: Finished difference Result 30232 states and 93411 transitions. [2019-12-19 05:21:35,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 05:21:35,450 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-12-19 05:21:35,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:35,500 INFO L225 Difference]: With dead ends: 30232 [2019-12-19 05:21:35,500 INFO L226 Difference]: Without dead ends: 30232 [2019-12-19 05:21:35,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-19 05:21:35,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30232 states. [2019-12-19 05:21:35,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30232 to 21553. [2019-12-19 05:21:35,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21553 states. [2019-12-19 05:21:35,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21553 states to 21553 states and 66907 transitions. [2019-12-19 05:21:35,846 INFO L78 Accepts]: Start accepts. Automaton has 21553 states and 66907 transitions. Word has length 80 [2019-12-19 05:21:35,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:35,846 INFO L462 AbstractCegarLoop]: Abstraction has 21553 states and 66907 transitions. [2019-12-19 05:21:35,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:21:35,846 INFO L276 IsEmpty]: Start isEmpty. Operand 21553 states and 66907 transitions. [2019-12-19 05:21:35,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 05:21:35,864 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:35,864 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] [2019-12-19 05:21:35,864 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:35,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:35,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1141126331, now seen corresponding path program 1 times [2019-12-19 05:21:35,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:35,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961465991] [2019-12-19 05:21:35,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:35,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:35,922 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-19 05:21:35,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961465991] [2019-12-19 05:21:35,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:35,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 05:21:35,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402657018] [2019-12-19 05:21:35,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 05:21:35,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:35,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 05:21:35,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 05:21:35,930 INFO L87 Difference]: Start difference. First operand 21553 states and 66907 transitions. Second operand 4 states. [2019-12-19 05:21:36,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:36,614 INFO L93 Difference]: Finished difference Result 28569 states and 87453 transitions. [2019-12-19 05:21:36,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 05:21:36,614 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-12-19 05:21:36,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:36,664 INFO L225 Difference]: With dead ends: 28569 [2019-12-19 05:21:36,664 INFO L226 Difference]: Without dead ends: 28569 [2019-12-19 05:21:36,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-19 05:21:36,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28569 states. [2019-12-19 05:21:37,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28569 to 25906. [2019-12-19 05:21:37,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25906 states. [2019-12-19 05:21:37,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25906 states to 25906 states and 79893 transitions. [2019-12-19 05:21:37,181 INFO L78 Accepts]: Start accepts. Automaton has 25906 states and 79893 transitions. Word has length 80 [2019-12-19 05:21:37,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:37,181 INFO L462 AbstractCegarLoop]: Abstraction has 25906 states and 79893 transitions. [2019-12-19 05:21:37,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 05:21:37,182 INFO L276 IsEmpty]: Start isEmpty. Operand 25906 states and 79893 transitions. [2019-12-19 05:21:37,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 05:21:37,204 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:37,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] [2019-12-19 05:21:37,204 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:37,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:37,205 INFO L82 PathProgramCache]: Analyzing trace with hash -502495842, now seen corresponding path program 1 times [2019-12-19 05:21:37,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:37,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888412319] [2019-12-19 05:21:37,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:37,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:37,254 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-19 05:21:37,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888412319] [2019-12-19 05:21:37,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:37,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 05:21:37,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854881792] [2019-12-19 05:21:37,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 05:21:37,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:37,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 05:21:37,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 05:21:37,257 INFO L87 Difference]: Start difference. First operand 25906 states and 79893 transitions. Second operand 3 states. [2019-12-19 05:21:37,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:37,341 INFO L93 Difference]: Finished difference Result 24700 states and 74782 transitions. [2019-12-19 05:21:37,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 05:21:37,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-12-19 05:21:37,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:37,377 INFO L225 Difference]: With dead ends: 24700 [2019-12-19 05:21:37,377 INFO L226 Difference]: Without dead ends: 24700 [2019-12-19 05:21:37,378 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-19 05:21:37,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24700 states. [2019-12-19 05:21:37,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24700 to 23473. [2019-12-19 05:21:37,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23473 states. [2019-12-19 05:21:37,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23473 states to 23473 states and 71381 transitions. [2019-12-19 05:21:37,699 INFO L78 Accepts]: Start accepts. Automaton has 23473 states and 71381 transitions. Word has length 80 [2019-12-19 05:21:37,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:37,699 INFO L462 AbstractCegarLoop]: Abstraction has 23473 states and 71381 transitions. [2019-12-19 05:21:37,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 05:21:37,699 INFO L276 IsEmpty]: Start isEmpty. Operand 23473 states and 71381 transitions. [2019-12-19 05:21:37,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 05:21:37,725 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:37,725 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] [2019-12-19 05:21:37,725 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:37,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:37,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1017053084, now seen corresponding path program 1 times [2019-12-19 05:21:37,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:37,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512770745] [2019-12-19 05:21:37,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:37,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:37,802 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-19 05:21:37,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512770745] [2019-12-19 05:21:37,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:37,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:21:37,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353572764] [2019-12-19 05:21:37,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:21:37,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:37,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:21:37,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:21:37,804 INFO L87 Difference]: Start difference. First operand 23473 states and 71381 transitions. Second operand 6 states. [2019-12-19 05:21:38,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:38,130 INFO L93 Difference]: Finished difference Result 24021 states and 72777 transitions. [2019-12-19 05:21:38,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:21:38,131 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-12-19 05:21:38,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:38,164 INFO L225 Difference]: With dead ends: 24021 [2019-12-19 05:21:38,165 INFO L226 Difference]: Without dead ends: 24021 [2019-12-19 05:21:38,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-19 05:21:38,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24021 states. [2019-12-19 05:21:38,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24021 to 23419. [2019-12-19 05:21:38,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23419 states. [2019-12-19 05:21:38,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23419 states to 23419 states and 71162 transitions. [2019-12-19 05:21:38,482 INFO L78 Accepts]: Start accepts. Automaton has 23419 states and 71162 transitions. Word has length 80 [2019-12-19 05:21:38,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:38,482 INFO L462 AbstractCegarLoop]: Abstraction has 23419 states and 71162 transitions. [2019-12-19 05:21:38,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:21:38,482 INFO L276 IsEmpty]: Start isEmpty. Operand 23419 states and 71162 transitions. [2019-12-19 05:21:38,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 05:21:38,503 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:38,504 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] [2019-12-19 05:21:38,504 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:38,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:38,504 INFO L82 PathProgramCache]: Analyzing trace with hash 615750915, now seen corresponding path program 1 times [2019-12-19 05:21:38,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:38,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19494896] [2019-12-19 05:21:38,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:38,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:38,626 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-19 05:21:38,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19494896] [2019-12-19 05:21:38,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:38,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:21:38,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601684546] [2019-12-19 05:21:38,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:21:38,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:38,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:21:38,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:21:38,628 INFO L87 Difference]: Start difference. First operand 23419 states and 71162 transitions. Second operand 5 states. [2019-12-19 05:21:38,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:38,872 INFO L93 Difference]: Finished difference Result 23362 states and 70971 transitions. [2019-12-19 05:21:38,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 05:21:38,873 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-12-19 05:21:38,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:38,906 INFO L225 Difference]: With dead ends: 23362 [2019-12-19 05:21:38,906 INFO L226 Difference]: Without dead ends: 23362 [2019-12-19 05:21:38,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:21:38,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23362 states. [2019-12-19 05:21:39,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23362 to 23323. [2019-12-19 05:21:39,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23323 states. [2019-12-19 05:21:39,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23323 states to 23323 states and 70867 transitions. [2019-12-19 05:21:39,349 INFO L78 Accepts]: Start accepts. Automaton has 23323 states and 70867 transitions. Word has length 80 [2019-12-19 05:21:39,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:39,350 INFO L462 AbstractCegarLoop]: Abstraction has 23323 states and 70867 transitions. [2019-12-19 05:21:39,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:21:39,350 INFO L276 IsEmpty]: Start isEmpty. Operand 23323 states and 70867 transitions. [2019-12-19 05:21:39,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 05:21:39,371 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:39,372 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] [2019-12-19 05:21:39,372 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:39,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:39,372 INFO L82 PathProgramCache]: Analyzing trace with hash 332600451, now seen corresponding path program 1 times [2019-12-19 05:21:39,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:39,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81124180] [2019-12-19 05:21:39,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:39,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:39,445 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-19 05:21:39,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81124180] [2019-12-19 05:21:39,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:39,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:21:39,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679002041] [2019-12-19 05:21:39,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:21:39,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:39,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:21:39,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:21:39,449 INFO L87 Difference]: Start difference. First operand 23323 states and 70867 transitions. Second operand 5 states. [2019-12-19 05:21:39,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:39,495 INFO L93 Difference]: Finished difference Result 3175 states and 7725 transitions. [2019-12-19 05:21:39,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 05:21:39,495 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-12-19 05:21:39,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:39,499 INFO L225 Difference]: With dead ends: 3175 [2019-12-19 05:21:39,500 INFO L226 Difference]: Without dead ends: 2657 [2019-12-19 05:21:39,501 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-19 05:21:39,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2657 states. [2019-12-19 05:21:39,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2657 to 2500. [2019-12-19 05:21:39,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2500 states. [2019-12-19 05:21:39,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2500 states to 2500 states and 6046 transitions. [2019-12-19 05:21:39,536 INFO L78 Accepts]: Start accepts. Automaton has 2500 states and 6046 transitions. Word has length 80 [2019-12-19 05:21:39,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:39,537 INFO L462 AbstractCegarLoop]: Abstraction has 2500 states and 6046 transitions. [2019-12-19 05:21:39,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:21:39,537 INFO L276 IsEmpty]: Start isEmpty. Operand 2500 states and 6046 transitions. [2019-12-19 05:21:39,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:21:39,539 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:39,539 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] [2019-12-19 05:21:39,539 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:39,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:39,539 INFO L82 PathProgramCache]: Analyzing trace with hash -972148400, now seen corresponding path program 1 times [2019-12-19 05:21:39,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:39,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190381071] [2019-12-19 05:21:39,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:39,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:39,597 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-19 05:21:39,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190381071] [2019-12-19 05:21:39,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:39,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:21:39,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045592145] [2019-12-19 05:21:39,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:21:39,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:39,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:21:39,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:21:39,599 INFO L87 Difference]: Start difference. First operand 2500 states and 6046 transitions. Second operand 5 states. [2019-12-19 05:21:39,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:39,823 INFO L93 Difference]: Finished difference Result 2838 states and 6804 transitions. [2019-12-19 05:21:39,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:21:39,824 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-12-19 05:21:39,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:39,828 INFO L225 Difference]: With dead ends: 2838 [2019-12-19 05:21:39,828 INFO L226 Difference]: Without dead ends: 2838 [2019-12-19 05:21:39,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 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-19 05:21:39,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2838 states. [2019-12-19 05:21:39,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2838 to 2578. [2019-12-19 05:21:39,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2578 states. [2019-12-19 05:21:39,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2578 states to 2578 states and 6210 transitions. [2019-12-19 05:21:39,854 INFO L78 Accepts]: Start accepts. Automaton has 2578 states and 6210 transitions. Word has length 92 [2019-12-19 05:21:39,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:39,854 INFO L462 AbstractCegarLoop]: Abstraction has 2578 states and 6210 transitions. [2019-12-19 05:21:39,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:21:39,854 INFO L276 IsEmpty]: Start isEmpty. Operand 2578 states and 6210 transitions. [2019-12-19 05:21:39,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:21:39,856 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:39,856 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] [2019-12-19 05:21:39,857 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:39,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:39,857 INFO L82 PathProgramCache]: Analyzing trace with hash 38995794, now seen corresponding path program 1 times [2019-12-19 05:21:39,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:39,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079912570] [2019-12-19 05:21:39,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:39,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:40,017 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-19 05:21:40,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079912570] [2019-12-19 05:21:40,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:40,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 05:21:40,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306867379] [2019-12-19 05:21:40,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 05:21:40,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:40,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 05:21:40,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:21:40,019 INFO L87 Difference]: Start difference. First operand 2578 states and 6210 transitions. Second operand 7 states. [2019-12-19 05:21:40,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:40,502 INFO L93 Difference]: Finished difference Result 2374 states and 5670 transitions. [2019-12-19 05:21:40,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:21:40,503 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-12-19 05:21:40,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:40,506 INFO L225 Difference]: With dead ends: 2374 [2019-12-19 05:21:40,506 INFO L226 Difference]: Without dead ends: 2374 [2019-12-19 05:21:40,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-12-19 05:21:40,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2374 states. [2019-12-19 05:21:40,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2374 to 2305. [2019-12-19 05:21:40,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2305 states. [2019-12-19 05:21:40,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2305 states to 2305 states and 5525 transitions. [2019-12-19 05:21:40,542 INFO L78 Accepts]: Start accepts. Automaton has 2305 states and 5525 transitions. Word has length 92 [2019-12-19 05:21:40,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:40,542 INFO L462 AbstractCegarLoop]: Abstraction has 2305 states and 5525 transitions. [2019-12-19 05:21:40,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 05:21:40,543 INFO L276 IsEmpty]: Start isEmpty. Operand 2305 states and 5525 transitions. [2019-12-19 05:21:40,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:21:40,545 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:40,546 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] [2019-12-19 05:21:40,546 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:40,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:40,546 INFO L82 PathProgramCache]: Analyzing trace with hash -869143036, now seen corresponding path program 1 times [2019-12-19 05:21:40,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:40,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851542686] [2019-12-19 05:21:40,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:40,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:40,671 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-19 05:21:40,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851542686] [2019-12-19 05:21:40,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:40,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:21:40,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309243762] [2019-12-19 05:21:40,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:21:40,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:40,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:21:40,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:21:40,673 INFO L87 Difference]: Start difference. First operand 2305 states and 5525 transitions. Second operand 6 states. [2019-12-19 05:21:40,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:40,777 INFO L93 Difference]: Finished difference Result 2566 states and 6034 transitions. [2019-12-19 05:21:40,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 05:21:40,778 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-12-19 05:21:40,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:40,780 INFO L225 Difference]: With dead ends: 2566 [2019-12-19 05:21:40,780 INFO L226 Difference]: Without dead ends: 2538 [2019-12-19 05:21:40,781 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-19 05:21:40,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2538 states. [2019-12-19 05:21:40,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2538 to 2332. [2019-12-19 05:21:40,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2332 states. [2019-12-19 05:21:40,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2332 states to 2332 states and 5556 transitions. [2019-12-19 05:21:40,803 INFO L78 Accepts]: Start accepts. Automaton has 2332 states and 5556 transitions. Word has length 92 [2019-12-19 05:21:40,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:40,803 INFO L462 AbstractCegarLoop]: Abstraction has 2332 states and 5556 transitions. [2019-12-19 05:21:40,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:21:40,803 INFO L276 IsEmpty]: Start isEmpty. Operand 2332 states and 5556 transitions. [2019-12-19 05:21:40,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:21:40,805 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:40,805 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] [2019-12-19 05:21:40,805 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:40,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:40,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1404367329, now seen corresponding path program 1 times [2019-12-19 05:21:40,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:40,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125654142] [2019-12-19 05:21:40,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:40,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:40,894 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-19 05:21:40,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125654142] [2019-12-19 05:21:40,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:40,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:21:40,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137141579] [2019-12-19 05:21:40,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:21:40,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:40,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:21:40,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:21:40,896 INFO L87 Difference]: Start difference. First operand 2332 states and 5556 transitions. Second operand 6 states. [2019-12-19 05:21:41,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:41,126 INFO L93 Difference]: Finished difference Result 4292 states and 10403 transitions. [2019-12-19 05:21:41,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 05:21:41,127 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-12-19 05:21:41,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:41,133 INFO L225 Difference]: With dead ends: 4292 [2019-12-19 05:21:41,134 INFO L226 Difference]: Without dead ends: 4292 [2019-12-19 05:21:41,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:21:41,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4292 states. [2019-12-19 05:21:41,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4292 to 2347. [2019-12-19 05:21:41,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2347 states. [2019-12-19 05:21:41,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2347 states to 2347 states and 5591 transitions. [2019-12-19 05:21:41,164 INFO L78 Accepts]: Start accepts. Automaton has 2347 states and 5591 transitions. Word has length 92 [2019-12-19 05:21:41,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:41,164 INFO L462 AbstractCegarLoop]: Abstraction has 2347 states and 5591 transitions. [2019-12-19 05:21:41,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:21:41,165 INFO L276 IsEmpty]: Start isEmpty. Operand 2347 states and 5591 transitions. [2019-12-19 05:21:41,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:21:41,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:41,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:21:41,167 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:41,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:41,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1528440576, now seen corresponding path program 1 times [2019-12-19 05:21:41,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:41,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156998493] [2019-12-19 05:21:41,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:41,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:41,279 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-19 05:21:41,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156998493] [2019-12-19 05:21:41,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:41,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 05:21:41,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733952408] [2019-12-19 05:21:41,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 05:21:41,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:41,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 05:21:41,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:21:41,281 INFO L87 Difference]: Start difference. First operand 2347 states and 5591 transitions. Second operand 7 states. [2019-12-19 05:21:41,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:41,748 INFO L93 Difference]: Finished difference Result 3281 states and 7693 transitions. [2019-12-19 05:21:41,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 05:21:41,748 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-12-19 05:21:41,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:41,753 INFO L225 Difference]: With dead ends: 3281 [2019-12-19 05:21:41,753 INFO L226 Difference]: Without dead ends: 3245 [2019-12-19 05:21:41,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-19 05:21:41,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3245 states. [2019-12-19 05:21:41,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3245 to 2665. [2019-12-19 05:21:41,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2665 states. [2019-12-19 05:21:41,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2665 states to 2665 states and 6299 transitions. [2019-12-19 05:21:41,799 INFO L78 Accepts]: Start accepts. Automaton has 2665 states and 6299 transitions. Word has length 92 [2019-12-19 05:21:41,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:41,799 INFO L462 AbstractCegarLoop]: Abstraction has 2665 states and 6299 transitions. [2019-12-19 05:21:41,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 05:21:41,800 INFO L276 IsEmpty]: Start isEmpty. Operand 2665 states and 6299 transitions. [2019-12-19 05:21:41,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:21:41,803 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:41,803 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] [2019-12-19 05:21:41,804 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:41,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:41,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1245290112, now seen corresponding path program 1 times [2019-12-19 05:21:41,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:41,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255212837] [2019-12-19 05:21:41,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:41,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:41,898 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-19 05:21:41,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255212837] [2019-12-19 05:21:41,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:41,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 05:21:41,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125803372] [2019-12-19 05:21:41,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 05:21:41,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:41,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 05:21:41,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:21:41,900 INFO L87 Difference]: Start difference. First operand 2665 states and 6299 transitions. Second operand 7 states. [2019-12-19 05:21:42,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:42,319 INFO L93 Difference]: Finished difference Result 3529 states and 8309 transitions. [2019-12-19 05:21:42,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:21:42,320 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-12-19 05:21:42,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:42,325 INFO L225 Difference]: With dead ends: 3529 [2019-12-19 05:21:42,326 INFO L226 Difference]: Without dead ends: 3529 [2019-12-19 05:21:42,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-19 05:21:42,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3529 states. [2019-12-19 05:21:42,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3529 to 2901. [2019-12-19 05:21:42,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2901 states. [2019-12-19 05:21:42,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2901 states to 2901 states and 6889 transitions. [2019-12-19 05:21:42,363 INFO L78 Accepts]: Start accepts. Automaton has 2901 states and 6889 transitions. Word has length 92 [2019-12-19 05:21:42,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:42,363 INFO L462 AbstractCegarLoop]: Abstraction has 2901 states and 6889 transitions. [2019-12-19 05:21:42,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 05:21:42,363 INFO L276 IsEmpty]: Start isEmpty. Operand 2901 states and 6889 transitions. [2019-12-19 05:21:42,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:21:42,366 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:42,366 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] [2019-12-19 05:21:42,366 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:42,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:42,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1804912703, now seen corresponding path program 1 times [2019-12-19 05:21:42,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:42,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78009386] [2019-12-19 05:21:42,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:42,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:42,415 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-19 05:21:42,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78009386] [2019-12-19 05:21:42,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:42,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 05:21:42,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076022608] [2019-12-19 05:21:42,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 05:21:42,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:42,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 05:21:42,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 05:21:42,417 INFO L87 Difference]: Start difference. First operand 2901 states and 6889 transitions. Second operand 3 states. [2019-12-19 05:21:42,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:42,468 INFO L93 Difference]: Finished difference Result 2739 states and 6403 transitions. [2019-12-19 05:21:42,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 05:21:42,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-12-19 05:21:42,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:42,472 INFO L225 Difference]: With dead ends: 2739 [2019-12-19 05:21:42,473 INFO L226 Difference]: Without dead ends: 2721 [2019-12-19 05:21:42,474 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-19 05:21:42,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2721 states. [2019-12-19 05:21:42,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2721 to 2335. [2019-12-19 05:21:42,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2335 states. [2019-12-19 05:21:42,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2335 states to 2335 states and 5471 transitions. [2019-12-19 05:21:42,504 INFO L78 Accepts]: Start accepts. Automaton has 2335 states and 5471 transitions. Word has length 92 [2019-12-19 05:21:42,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:42,504 INFO L462 AbstractCegarLoop]: Abstraction has 2335 states and 5471 transitions. [2019-12-19 05:21:42,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 05:21:42,505 INFO L276 IsEmpty]: Start isEmpty. Operand 2335 states and 5471 transitions. [2019-12-19 05:21:42,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 05:21:42,506 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:42,507 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] [2019-12-19 05:21:42,507 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:42,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:42,507 INFO L82 PathProgramCache]: Analyzing trace with hash -436198428, now seen corresponding path program 1 times [2019-12-19 05:21:42,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:42,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010400697] [2019-12-19 05:21:42,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:42,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:42,626 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-19 05:21:42,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010400697] [2019-12-19 05:21:42,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:42,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:21:42,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868075650] [2019-12-19 05:21:42,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:21:42,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:42,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:21:42,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:21:42,628 INFO L87 Difference]: Start difference. First operand 2335 states and 5471 transitions. Second operand 6 states. [2019-12-19 05:21:42,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:42,781 INFO L93 Difference]: Finished difference Result 2575 states and 5940 transitions. [2019-12-19 05:21:42,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 05:21:42,781 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-19 05:21:42,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:42,784 INFO L225 Difference]: With dead ends: 2575 [2019-12-19 05:21:42,784 INFO L226 Difference]: Without dead ends: 2575 [2019-12-19 05:21:42,785 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-19 05:21:42,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2575 states. [2019-12-19 05:21:42,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2575 to 2395. [2019-12-19 05:21:42,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2395 states. [2019-12-19 05:21:42,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2395 states to 2395 states and 5582 transitions. [2019-12-19 05:21:42,808 INFO L78 Accepts]: Start accepts. Automaton has 2395 states and 5582 transitions. Word has length 94 [2019-12-19 05:21:42,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:42,808 INFO L462 AbstractCegarLoop]: Abstraction has 2395 states and 5582 transitions. [2019-12-19 05:21:42,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:21:42,808 INFO L276 IsEmpty]: Start isEmpty. Operand 2395 states and 5582 transitions. [2019-12-19 05:21:42,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 05:21:42,810 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:42,810 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] [2019-12-19 05:21:42,810 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:42,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:42,811 INFO L82 PathProgramCache]: Analyzing trace with hash -106432667, now seen corresponding path program 1 times [2019-12-19 05:21:42,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:42,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842251523] [2019-12-19 05:21:42,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:42,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:42,865 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-19 05:21:42,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842251523] [2019-12-19 05:21:42,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:42,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 05:21:42,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766756473] [2019-12-19 05:21:42,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 05:21:42,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:42,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 05:21:42,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 05:21:42,867 INFO L87 Difference]: Start difference. First operand 2395 states and 5582 transitions. Second operand 4 states. [2019-12-19 05:21:42,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:42,932 INFO L93 Difference]: Finished difference Result 2395 states and 5546 transitions. [2019-12-19 05:21:42,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 05:21:42,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-12-19 05:21:42,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:42,936 INFO L225 Difference]: With dead ends: 2395 [2019-12-19 05:21:42,936 INFO L226 Difference]: Without dead ends: 2395 [2019-12-19 05:21:42,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-19 05:21:42,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2395 states. [2019-12-19 05:21:42,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2395 to 1922. [2019-12-19 05:21:42,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1922 states. [2019-12-19 05:21:42,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 4532 transitions. [2019-12-19 05:21:42,966 INFO L78 Accepts]: Start accepts. Automaton has 1922 states and 4532 transitions. Word has length 94 [2019-12-19 05:21:42,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:42,966 INFO L462 AbstractCegarLoop]: Abstraction has 1922 states and 4532 transitions. [2019-12-19 05:21:42,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 05:21:42,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 4532 transitions. [2019-12-19 05:21:42,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 05:21:42,969 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:42,969 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] [2019-12-19 05:21:42,970 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:42,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:42,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1154922491, now seen corresponding path program 1 times [2019-12-19 05:21:42,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:42,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735706028] [2019-12-19 05:21:42,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:43,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:43,060 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-19 05:21:43,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735706028] [2019-12-19 05:21:43,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:43,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:21:43,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733438389] [2019-12-19 05:21:43,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:21:43,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:43,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:21:43,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:21:43,062 INFO L87 Difference]: Start difference. First operand 1922 states and 4532 transitions. Second operand 5 states. [2019-12-19 05:21:43,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:43,252 INFO L93 Difference]: Finished difference Result 2174 states and 5111 transitions. [2019-12-19 05:21:43,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 05:21:43,253 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-12-19 05:21:43,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:43,256 INFO L225 Difference]: With dead ends: 2174 [2019-12-19 05:21:43,256 INFO L226 Difference]: Without dead ends: 2156 [2019-12-19 05:21:43,258 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-19 05:21:43,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2019-12-19 05:21:43,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 1949. [2019-12-19 05:21:43,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1949 states. [2019-12-19 05:21:43,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 4586 transitions. [2019-12-19 05:21:43,288 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 4586 transitions. Word has length 94 [2019-12-19 05:21:43,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:43,288 INFO L462 AbstractCegarLoop]: Abstraction has 1949 states and 4586 transitions. [2019-12-19 05:21:43,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:21:43,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 4586 transitions. [2019-12-19 05:21:43,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 05:21:43,291 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:43,291 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] [2019-12-19 05:21:43,291 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:43,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:43,291 INFO L82 PathProgramCache]: Analyzing trace with hash 89841990, now seen corresponding path program 1 times [2019-12-19 05:21:43,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:43,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545178142] [2019-12-19 05:21:43,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:43,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:43,459 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-19 05:21:43,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545178142] [2019-12-19 05:21:43,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:43,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:21:43,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571993231] [2019-12-19 05:21:43,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:21:43,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:43,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:21:43,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:21:43,461 INFO L87 Difference]: Start difference. First operand 1949 states and 4586 transitions. Second operand 6 states. [2019-12-19 05:21:43,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:43,556 INFO L93 Difference]: Finished difference Result 3109 states and 7432 transitions. [2019-12-19 05:21:43,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 05:21:43,557 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-19 05:21:43,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:43,559 INFO L225 Difference]: With dead ends: 3109 [2019-12-19 05:21:43,559 INFO L226 Difference]: Without dead ends: 1229 [2019-12-19 05:21:43,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-19 05:21:43,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2019-12-19 05:21:43,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1229. [2019-12-19 05:21:43,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1229 states. [2019-12-19 05:21:43,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 2953 transitions. [2019-12-19 05:21:43,588 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 2953 transitions. Word has length 94 [2019-12-19 05:21:43,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:43,589 INFO L462 AbstractCegarLoop]: Abstraction has 1229 states and 2953 transitions. [2019-12-19 05:21:43,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:21:43,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 2953 transitions. [2019-12-19 05:21:43,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 05:21:43,591 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:43,591 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] [2019-12-19 05:21:43,591 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:43,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:43,592 INFO L82 PathProgramCache]: Analyzing trace with hash 373162808, now seen corresponding path program 1 times [2019-12-19 05:21:43,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:43,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743300644] [2019-12-19 05:21:43,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:43,680 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-19 05:21:43,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743300644] [2019-12-19 05:21:43,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:43,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:21:43,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74183538] [2019-12-19 05:21:43,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:21:43,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:43,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:21:43,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:21:43,682 INFO L87 Difference]: Start difference. First operand 1229 states and 2953 transitions. Second operand 5 states. [2019-12-19 05:21:44,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:44,154 INFO L93 Difference]: Finished difference Result 3090 states and 7647 transitions. [2019-12-19 05:21:44,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 05:21:44,155 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-12-19 05:21:44,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:44,160 INFO L225 Difference]: With dead ends: 3090 [2019-12-19 05:21:44,160 INFO L226 Difference]: Without dead ends: 3090 [2019-12-19 05:21:44,160 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-19 05:21:44,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3090 states. [2019-12-19 05:21:44,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3090 to 1221. [2019-12-19 05:21:44,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1221 states. [2019-12-19 05:21:44,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 2937 transitions. [2019-12-19 05:21:44,180 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 2937 transitions. Word has length 94 [2019-12-19 05:21:44,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:44,180 INFO L462 AbstractCegarLoop]: Abstraction has 1221 states and 2937 transitions. [2019-12-19 05:21:44,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:21:44,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 2937 transitions. [2019-12-19 05:21:44,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 05:21:44,181 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:44,182 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] [2019-12-19 05:21:44,182 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:44,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:44,182 INFO L82 PathProgramCache]: Analyzing trace with hash 104916029, now seen corresponding path program 1 times [2019-12-19 05:21:44,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:44,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724266633] [2019-12-19 05:21:44,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:44,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:44,256 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-19 05:21:44,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724266633] [2019-12-19 05:21:44,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:44,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:21:44,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622148370] [2019-12-19 05:21:44,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:21:44,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:44,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:21:44,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:21:44,258 INFO L87 Difference]: Start difference. First operand 1221 states and 2937 transitions. Second operand 5 states. [2019-12-19 05:21:44,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:44,290 INFO L93 Difference]: Finished difference Result 1221 states and 2902 transitions. [2019-12-19 05:21:44,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 05:21:44,291 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-12-19 05:21:44,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:44,292 INFO L225 Difference]: With dead ends: 1221 [2019-12-19 05:21:44,293 INFO L226 Difference]: Without dead ends: 1221 [2019-12-19 05:21:44,293 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-19 05:21:44,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2019-12-19 05:21:44,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 1181. [2019-12-19 05:21:44,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1181 states. [2019-12-19 05:21:44,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 2826 transitions. [2019-12-19 05:21:44,310 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 2826 transitions. Word has length 94 [2019-12-19 05:21:44,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:44,310 INFO L462 AbstractCegarLoop]: Abstraction has 1181 states and 2826 transitions. [2019-12-19 05:21:44,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:21:44,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 2826 transitions. [2019-12-19 05:21:44,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 05:21:44,312 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:44,312 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] [2019-12-19 05:21:44,312 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:44,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:44,312 INFO L82 PathProgramCache]: Analyzing trace with hash -919777892, now seen corresponding path program 2 times [2019-12-19 05:21:44,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:44,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7193751] [2019-12-19 05:21:44,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:44,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:44,484 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-19 05:21:44,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7193751] [2019-12-19 05:21:44,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:44,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-19 05:21:44,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744081540] [2019-12-19 05:21:44,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-19 05:21:44,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:44,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-19 05:21:44,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-12-19 05:21:44,487 INFO L87 Difference]: Start difference. First operand 1181 states and 2826 transitions. Second operand 11 states. [2019-12-19 05:21:44,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:44,736 INFO L93 Difference]: Finished difference Result 2271 states and 5486 transitions. [2019-12-19 05:21:44,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 05:21:44,736 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 94 [2019-12-19 05:21:44,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:44,739 INFO L225 Difference]: With dead ends: 2271 [2019-12-19 05:21:44,739 INFO L226 Difference]: Without dead ends: 1632 [2019-12-19 05:21:44,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2019-12-19 05:21:44,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1632 states. [2019-12-19 05:21:44,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1632 to 1534. [2019-12-19 05:21:44,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1534 states. [2019-12-19 05:21:44,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1534 states to 1534 states and 3570 transitions. [2019-12-19 05:21:44,763 INFO L78 Accepts]: Start accepts. Automaton has 1534 states and 3570 transitions. Word has length 94 [2019-12-19 05:21:44,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:44,763 INFO L462 AbstractCegarLoop]: Abstraction has 1534 states and 3570 transitions. [2019-12-19 05:21:44,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-19 05:21:44,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1534 states and 3570 transitions. [2019-12-19 05:21:44,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 05:21:44,766 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:44,766 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] [2019-12-19 05:21:44,766 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:44,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:44,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1370490878, now seen corresponding path program 3 times [2019-12-19 05:21:44,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:44,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695941417] [2019-12-19 05:21:44,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:44,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 05:21:44,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 05:21:44,908 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-19 05:21:44,908 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-19 05:21:45,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 05:21:45 BasicIcfg [2019-12-19 05:21:45,110 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-19 05:21:45,116 INFO L168 Benchmark]: Toolchain (without parser) took 52817.96 ms. Allocated memory was 138.4 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 102.0 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 743.6 MB. Max. memory is 7.1 GB. [2019-12-19 05:21:45,116 INFO L168 Benchmark]: CDTParser took 0.76 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-19 05:21:45,117 INFO L168 Benchmark]: CACSL2BoogieTranslator took 790.35 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 101.6 MB in the beginning and 154.6 MB in the end (delta: -53.0 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-19 05:21:45,117 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.59 ms. Allocated memory is still 201.9 MB. Free memory was 154.6 MB in the beginning and 151.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-19 05:21:45,117 INFO L168 Benchmark]: Boogie Preprocessor took 40.24 ms. Allocated memory is still 201.9 MB. Free memory was 151.8 MB in the beginning and 149.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-19 05:21:45,118 INFO L168 Benchmark]: RCFGBuilder took 829.24 ms. Allocated memory is still 201.9 MB. Free memory was 149.1 MB in the beginning and 105.6 MB in the end (delta: 43.5 MB). Peak memory consumption was 43.5 MB. Max. memory is 7.1 GB. [2019-12-19 05:21:45,118 INFO L168 Benchmark]: TraceAbstraction took 51077.46 ms. Allocated memory was 201.9 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 105.0 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 683.1 MB. Max. memory is 7.1 GB. [2019-12-19 05:21:45,120 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.76 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 790.35 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 101.6 MB in the beginning and 154.6 MB in the end (delta: -53.0 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.59 ms. Allocated memory is still 201.9 MB. Free memory was 154.6 MB in the beginning and 151.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.24 ms. Allocated memory is still 201.9 MB. Free memory was 151.8 MB in the beginning and 149.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 829.24 ms. Allocated memory is still 201.9 MB. Free memory was 149.1 MB in the beginning and 105.6 MB in the end (delta: 43.5 MB). Peak memory consumption was 43.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 51077.46 ms. Allocated memory was 201.9 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 105.0 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 683.1 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] [L695] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L696] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L698] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L699] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L700] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L701] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L702] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L703] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L704] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L705] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L706] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L707] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L708] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L709] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L710] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L711] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L712] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L714] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L715] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L716] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L776] 0 pthread_t t2483; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L777] FCALL, FORK 0 pthread_create(&t2483, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L778] 0 pthread_t t2484; VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L779] FCALL, FORK 0 pthread_create(&t2484, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L740] 2 x$w_buff1 = x$w_buff0 [L741] 2 x$w_buff0 = 2 [L742] 2 x$w_buff1_used = x$w_buff0_used [L743] 2 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L745] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L746] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L747] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L748] 2 x$r_buff0_thd2 = (_Bool)1 [L751] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L754] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L720] 1 y = 2 [L723] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L754] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L755] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L726] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L726] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=2, y=2] [L726] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)=2, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=2, y=2] [L726] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L727] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L727] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L728] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L728] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L729] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L729] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L730] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L730] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L733] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L755] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L756] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L756] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L757] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L757] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L758] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L758] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L761] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L781] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L786] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L786] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L787] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L787] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L788] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L788] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L789] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L789] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L792] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 0 x$flush_delayed = weak$$choice2 [L795] 0 x$mem_tmp = x VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L797] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L797] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L798] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L799] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L799] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L800] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L800] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L801] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L801] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L802] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L802] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] 0 main$tmp_guard1 = !(x == 2 && y == 2) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L804] EXPR 0 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L804] 0 x = x$flush_delayed ? x$mem_tmp : x [L805] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 139 locations, 2 error locations. Result: UNSAFE, OverallTime: 50.7s, OverallIterations: 37, TraceHistogramMax: 1, AutomataDifference: 19.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9037 SDtfs, 8823 SDslu, 19362 SDs, 0 SdLazy, 8385 SolverSat, 533 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 371 GetRequests, 106 SyntacticMatches, 22 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76077occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 22.7s AutomataMinimizationTime, 36 MinimizatonAttempts, 97598 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 2888 NumberOfCodeBlocks, 2888 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 2758 ConstructedInterpolants, 0 QuantifiedInterpolants, 510628 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 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...