/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/mix009_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-19 00:32:10,937 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-19 00:32:10,940 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-19 00:32:10,952 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-19 00:32:10,952 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-19 00:32:10,953 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-19 00:32:10,955 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-19 00:32:10,956 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-19 00:32:10,958 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-19 00:32:10,959 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-19 00:32:10,960 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-19 00:32:10,961 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-19 00:32:10,961 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-19 00:32:10,962 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-19 00:32:10,963 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-19 00:32:10,964 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-19 00:32:10,965 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-19 00:32:10,966 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-19 00:32:10,968 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-19 00:32:10,969 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-19 00:32:10,971 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-19 00:32:10,972 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-19 00:32:10,973 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-19 00:32:10,974 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-19 00:32:10,976 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-19 00:32:10,976 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-19 00:32:10,976 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-19 00:32:10,977 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-19 00:32:10,978 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-19 00:32:10,979 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-19 00:32:10,979 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-19 00:32:10,981 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-19 00:32:10,982 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-19 00:32:10,982 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-19 00:32:10,983 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-19 00:32:10,983 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-19 00:32:10,984 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-19 00:32:10,984 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-19 00:32:10,985 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-19 00:32:10,985 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-19 00:32:10,986 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-19 00:32:10,989 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 00:32:11,009 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-19 00:32:11,010 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-19 00:32:11,012 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-19 00:32:11,012 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-19 00:32:11,012 INFO L138 SettingsManager]: * Use SBE=true [2019-12-19 00:32:11,013 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-19 00:32:11,013 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-19 00:32:11,013 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-19 00:32:11,013 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-19 00:32:11,013 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-19 00:32:11,014 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-19 00:32:11,015 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-19 00:32:11,015 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-19 00:32:11,015 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-19 00:32:11,016 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-19 00:32:11,016 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-19 00:32:11,016 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-19 00:32:11,016 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-19 00:32:11,016 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-19 00:32:11,017 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-19 00:32:11,017 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-19 00:32:11,017 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 00:32:11,017 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-19 00:32:11,018 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-19 00:32:11,018 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-19 00:32:11,018 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-19 00:32:11,018 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-19 00:32:11,018 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-19 00:32:11,018 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-19 00:32:11,019 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-19 00:32:11,315 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-19 00:32:11,342 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-19 00:32:11,346 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-19 00:32:11,347 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-19 00:32:11,348 INFO L275 PluginConnector]: CDTParser initialized [2019-12-19 00:32:11,349 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix009_pso.oepc.i [2019-12-19 00:32:11,425 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0390ca27/9f598e572a744fcdbe664ebbfeeae301/FLAG5af0acdc9 [2019-12-19 00:32:12,038 INFO L306 CDTParser]: Found 1 translation units. [2019-12-19 00:32:12,039 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix009_pso.oepc.i [2019-12-19 00:32:12,065 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0390ca27/9f598e572a744fcdbe664ebbfeeae301/FLAG5af0acdc9 [2019-12-19 00:32:12,327 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0390ca27/9f598e572a744fcdbe664ebbfeeae301 [2019-12-19 00:32:12,335 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-19 00:32:12,337 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-19 00:32:12,338 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-19 00:32:12,338 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-19 00:32:12,342 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-19 00:32:12,343 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 12:32:12" (1/1) ... [2019-12-19 00:32:12,346 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6171d743 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:32:12, skipping insertion in model container [2019-12-19 00:32:12,346 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 12:32:12" (1/1) ... [2019-12-19 00:32:12,354 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-19 00:32:12,409 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-19 00:32:12,932 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 00:32:12,944 INFO L203 MainTranslator]: Completed pre-run [2019-12-19 00:32:13,037 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 00:32:13,113 INFO L208 MainTranslator]: Completed translation [2019-12-19 00:32:13,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:32:13 WrapperNode [2019-12-19 00:32:13,114 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-19 00:32:13,115 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-19 00:32:13,115 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-19 00:32:13,115 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-19 00:32:13,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:32:13" (1/1) ... [2019-12-19 00:32:13,145 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:32:13" (1/1) ... [2019-12-19 00:32:13,177 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-19 00:32:13,178 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-19 00:32:13,178 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-19 00:32:13,178 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-19 00:32:13,188 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:32:13" (1/1) ... [2019-12-19 00:32:13,189 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:32:13" (1/1) ... [2019-12-19 00:32:13,203 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:32:13" (1/1) ... [2019-12-19 00:32:13,204 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:32:13" (1/1) ... [2019-12-19 00:32:13,222 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:32:13" (1/1) ... [2019-12-19 00:32:13,228 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:32:13" (1/1) ... [2019-12-19 00:32:13,237 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:32:13" (1/1) ... [2019-12-19 00:32:13,245 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-19 00:32:13,245 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-19 00:32:13,245 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-19 00:32:13,246 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-19 00:32:13,252 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:32:13" (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 00:32:13,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-19 00:32:13,325 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-19 00:32:13,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-19 00:32:13,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-19 00:32:13,325 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-19 00:32:13,325 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-19 00:32:13,326 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-19 00:32:13,326 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-19 00:32:13,326 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-19 00:32:13,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-19 00:32:13,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-19 00:32:13,328 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 00:32:14,093 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-19 00:32:14,093 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-19 00:32:14,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 12:32:14 BoogieIcfgContainer [2019-12-19 00:32:14,095 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-19 00:32:14,096 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-19 00:32:14,096 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-19 00:32:14,099 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-19 00:32:14,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 12:32:12" (1/3) ... [2019-12-19 00:32:14,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77c6d34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 12:32:14, skipping insertion in model container [2019-12-19 00:32:14,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:32:13" (2/3) ... [2019-12-19 00:32:14,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77c6d34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 12:32:14, skipping insertion in model container [2019-12-19 00:32:14,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 12:32:14" (3/3) ... [2019-12-19 00:32:14,104 INFO L109 eAbstractionObserver]: Analyzing ICFG mix009_pso.oepc.i [2019-12-19 00:32:14,114 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-19 00:32:14,115 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-19 00:32:14,123 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-19 00:32:14,124 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-19 00:32:14,161 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,162 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,162 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,162 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,162 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,162 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,163 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,163 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,164 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,164 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,164 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,173 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,173 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,222 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,223 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,223 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,223 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,223 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,236 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,239 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:14,258 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-19 00:32:14,280 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-19 00:32:14,280 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-19 00:32:14,280 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-19 00:32:14,280 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-19 00:32:14,281 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-19 00:32:14,281 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-19 00:32:14,281 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-19 00:32:14,281 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-19 00:32:14,300 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 150 places, 184 transitions [2019-12-19 00:32:16,330 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32594 states. [2019-12-19 00:32:16,332 INFO L276 IsEmpty]: Start isEmpty. Operand 32594 states. [2019-12-19 00:32:16,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-19 00:32:16,343 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:16,344 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] [2019-12-19 00:32:16,345 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:16,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:16,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1842126657, now seen corresponding path program 1 times [2019-12-19 00:32:16,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:16,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803426285] [2019-12-19 00:32:16,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:16,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:16,652 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 00:32:16,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803426285] [2019-12-19 00:32:16,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:16,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 00:32:16,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287580366] [2019-12-19 00:32:16,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 00:32:16,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:16,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 00:32:16,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 00:32:16,679 INFO L87 Difference]: Start difference. First operand 32594 states. Second operand 4 states. [2019-12-19 00:32:17,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:17,344 INFO L93 Difference]: Finished difference Result 33594 states and 129571 transitions. [2019-12-19 00:32:17,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 00:32:17,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-12-19 00:32:17,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:18,529 INFO L225 Difference]: With dead ends: 33594 [2019-12-19 00:32:18,529 INFO L226 Difference]: Without dead ends: 25706 [2019-12-19 00:32:18,531 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 00:32:18,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25706 states. [2019-12-19 00:32:19,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25706 to 25706. [2019-12-19 00:32:19,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25706 states. [2019-12-19 00:32:20,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25706 states to 25706 states and 99587 transitions. [2019-12-19 00:32:20,033 INFO L78 Accepts]: Start accepts. Automaton has 25706 states and 99587 transitions. Word has length 37 [2019-12-19 00:32:20,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:20,036 INFO L462 AbstractCegarLoop]: Abstraction has 25706 states and 99587 transitions. [2019-12-19 00:32:20,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 00:32:20,037 INFO L276 IsEmpty]: Start isEmpty. Operand 25706 states and 99587 transitions. [2019-12-19 00:32:20,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-19 00:32:20,051 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:20,051 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] [2019-12-19 00:32:20,052 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:20,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:20,052 INFO L82 PathProgramCache]: Analyzing trace with hash 994831418, now seen corresponding path program 1 times [2019-12-19 00:32:20,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:20,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72761273] [2019-12-19 00:32:20,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:20,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:20,231 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 00:32:20,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72761273] [2019-12-19 00:32:20,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:20,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 00:32:20,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14091352] [2019-12-19 00:32:20,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 00:32:20,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:20,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 00:32:20,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:32:20,235 INFO L87 Difference]: Start difference. First operand 25706 states and 99587 transitions. Second operand 5 states. [2019-12-19 00:32:21,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:21,321 INFO L93 Difference]: Finished difference Result 41084 states and 150434 transitions. [2019-12-19 00:32:21,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 00:32:21,322 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-12-19 00:32:21,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:21,483 INFO L225 Difference]: With dead ends: 41084 [2019-12-19 00:32:21,483 INFO L226 Difference]: Without dead ends: 40548 [2019-12-19 00:32:21,484 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 00:32:23,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40548 states. [2019-12-19 00:32:24,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40548 to 38928. [2019-12-19 00:32:24,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38928 states. [2019-12-19 00:32:24,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38928 states to 38928 states and 143584 transitions. [2019-12-19 00:32:24,320 INFO L78 Accepts]: Start accepts. Automaton has 38928 states and 143584 transitions. Word has length 49 [2019-12-19 00:32:24,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:24,322 INFO L462 AbstractCegarLoop]: Abstraction has 38928 states and 143584 transitions. [2019-12-19 00:32:24,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 00:32:24,323 INFO L276 IsEmpty]: Start isEmpty. Operand 38928 states and 143584 transitions. [2019-12-19 00:32:24,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-19 00:32:24,340 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:24,341 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] [2019-12-19 00:32:24,341 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:24,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:24,341 INFO L82 PathProgramCache]: Analyzing trace with hash -351997153, now seen corresponding path program 1 times [2019-12-19 00:32:24,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:24,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368918353] [2019-12-19 00:32:24,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:24,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:24,464 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 00:32:24,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368918353] [2019-12-19 00:32:24,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:24,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 00:32:24,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026085272] [2019-12-19 00:32:24,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 00:32:24,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:24,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 00:32:24,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:32:24,468 INFO L87 Difference]: Start difference. First operand 38928 states and 143584 transitions. Second operand 5 states. [2019-12-19 00:32:25,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:25,027 INFO L93 Difference]: Finished difference Result 49781 states and 180636 transitions. [2019-12-19 00:32:25,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 00:32:25,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-12-19 00:32:25,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:26,981 INFO L225 Difference]: With dead ends: 49781 [2019-12-19 00:32:26,982 INFO L226 Difference]: Without dead ends: 49277 [2019-12-19 00:32:26,982 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 00:32:27,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49277 states. [2019-12-19 00:32:28,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49277 to 42680. [2019-12-19 00:32:28,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42680 states. [2019-12-19 00:32:28,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42680 states to 42680 states and 156595 transitions. [2019-12-19 00:32:28,227 INFO L78 Accepts]: Start accepts. Automaton has 42680 states and 156595 transitions. Word has length 50 [2019-12-19 00:32:28,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:28,227 INFO L462 AbstractCegarLoop]: Abstraction has 42680 states and 156595 transitions. [2019-12-19 00:32:28,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 00:32:28,228 INFO L276 IsEmpty]: Start isEmpty. Operand 42680 states and 156595 transitions. [2019-12-19 00:32:28,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-19 00:32:28,236 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:28,236 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:32:28,237 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:28,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:28,237 INFO L82 PathProgramCache]: Analyzing trace with hash 2004382981, now seen corresponding path program 1 times [2019-12-19 00:32:28,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:28,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792448940] [2019-12-19 00:32:28,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:28,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:28,304 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 00:32:28,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792448940] [2019-12-19 00:32:28,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:28,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 00:32:28,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628238298] [2019-12-19 00:32:28,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 00:32:28,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:28,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 00:32:28,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 00:32:28,308 INFO L87 Difference]: Start difference. First operand 42680 states and 156595 transitions. Second operand 3 states. [2019-12-19 00:32:28,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:28,608 INFO L93 Difference]: Finished difference Result 61090 states and 221433 transitions. [2019-12-19 00:32:28,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 00:32:28,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-19 00:32:28,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:28,828 INFO L225 Difference]: With dead ends: 61090 [2019-12-19 00:32:28,828 INFO L226 Difference]: Without dead ends: 61090 [2019-12-19 00:32:28,829 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 00:32:29,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61090 states. [2019-12-19 00:32:32,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61090 to 48019. [2019-12-19 00:32:32,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48019 states. [2019-12-19 00:32:32,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48019 states to 48019 states and 174182 transitions. [2019-12-19 00:32:32,426 INFO L78 Accepts]: Start accepts. Automaton has 48019 states and 174182 transitions. Word has length 52 [2019-12-19 00:32:32,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:32,426 INFO L462 AbstractCegarLoop]: Abstraction has 48019 states and 174182 transitions. [2019-12-19 00:32:32,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 00:32:32,426 INFO L276 IsEmpty]: Start isEmpty. Operand 48019 states and 174182 transitions. [2019-12-19 00:32:32,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-19 00:32:32,444 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:32,444 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] [2019-12-19 00:32:32,444 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:32,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:32,445 INFO L82 PathProgramCache]: Analyzing trace with hash -189838484, now seen corresponding path program 1 times [2019-12-19 00:32:32,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:32,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413801628] [2019-12-19 00:32:32,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:32,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:32,589 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 00:32:32,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413801628] [2019-12-19 00:32:32,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:32,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 00:32:32,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21218243] [2019-12-19 00:32:32,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 00:32:32,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:32,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 00:32:32,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:32:32,593 INFO L87 Difference]: Start difference. First operand 48019 states and 174182 transitions. Second operand 6 states. [2019-12-19 00:32:33,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:33,445 INFO L93 Difference]: Finished difference Result 63759 states and 229382 transitions. [2019-12-19 00:32:33,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 00:32:33,446 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-19 00:32:33,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:33,588 INFO L225 Difference]: With dead ends: 63759 [2019-12-19 00:32:33,588 INFO L226 Difference]: Without dead ends: 63759 [2019-12-19 00:32:33,589 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 00:32:33,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63759 states. [2019-12-19 00:32:34,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63759 to 59952. [2019-12-19 00:32:34,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59952 states. [2019-12-19 00:32:37,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59952 states to 59952 states and 215675 transitions. [2019-12-19 00:32:37,902 INFO L78 Accepts]: Start accepts. Automaton has 59952 states and 215675 transitions. Word has length 56 [2019-12-19 00:32:37,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:37,903 INFO L462 AbstractCegarLoop]: Abstraction has 59952 states and 215675 transitions. [2019-12-19 00:32:37,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 00:32:37,903 INFO L276 IsEmpty]: Start isEmpty. Operand 59952 states and 215675 transitions. [2019-12-19 00:32:37,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-19 00:32:37,925 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:37,925 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] [2019-12-19 00:32:37,926 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:37,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:37,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1986789843, now seen corresponding path program 1 times [2019-12-19 00:32:37,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:37,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169297707] [2019-12-19 00:32:37,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:37,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:38,093 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 00:32:38,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169297707] [2019-12-19 00:32:38,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:38,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 00:32:38,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807330456] [2019-12-19 00:32:38,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 00:32:38,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:38,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 00:32:38,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 00:32:38,097 INFO L87 Difference]: Start difference. First operand 59952 states and 215675 transitions. Second operand 7 states. [2019-12-19 00:32:39,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:39,457 INFO L93 Difference]: Finished difference Result 83688 states and 290100 transitions. [2019-12-19 00:32:39,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 00:32:39,458 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-12-19 00:32:39,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:39,641 INFO L225 Difference]: With dead ends: 83688 [2019-12-19 00:32:39,641 INFO L226 Difference]: Without dead ends: 83688 [2019-12-19 00:32:39,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 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 00:32:39,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83688 states. [2019-12-19 00:32:41,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83688 to 71015. [2019-12-19 00:32:41,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71015 states. [2019-12-19 00:32:41,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71015 states to 71015 states and 249889 transitions. [2019-12-19 00:32:41,372 INFO L78 Accepts]: Start accepts. Automaton has 71015 states and 249889 transitions. Word has length 56 [2019-12-19 00:32:41,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:41,372 INFO L462 AbstractCegarLoop]: Abstraction has 71015 states and 249889 transitions. [2019-12-19 00:32:41,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 00:32:41,373 INFO L276 IsEmpty]: Start isEmpty. Operand 71015 states and 249889 transitions. [2019-12-19 00:32:41,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-19 00:32:41,387 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:41,387 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] [2019-12-19 00:32:41,388 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:41,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:41,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1099286162, now seen corresponding path program 1 times [2019-12-19 00:32:41,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:41,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526994572] [2019-12-19 00:32:41,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:41,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:41,915 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 00:32:41,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526994572] [2019-12-19 00:32:41,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:41,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 00:32:41,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198162302] [2019-12-19 00:32:41,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 00:32:41,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:41,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 00:32:41,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 00:32:41,918 INFO L87 Difference]: Start difference. First operand 71015 states and 249889 transitions. Second operand 4 states. [2019-12-19 00:32:41,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:41,989 INFO L93 Difference]: Finished difference Result 12162 states and 37832 transitions. [2019-12-19 00:32:41,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 00:32:41,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-19 00:32:41,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:42,006 INFO L225 Difference]: With dead ends: 12162 [2019-12-19 00:32:42,006 INFO L226 Difference]: Without dead ends: 10677 [2019-12-19 00:32:42,006 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 00:32:42,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10677 states. [2019-12-19 00:32:42,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10677 to 10628. [2019-12-19 00:32:42,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10628 states. [2019-12-19 00:32:42,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10628 states to 10628 states and 32594 transitions. [2019-12-19 00:32:42,154 INFO L78 Accepts]: Start accepts. Automaton has 10628 states and 32594 transitions. Word has length 56 [2019-12-19 00:32:42,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:42,154 INFO L462 AbstractCegarLoop]: Abstraction has 10628 states and 32594 transitions. [2019-12-19 00:32:42,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 00:32:42,154 INFO L276 IsEmpty]: Start isEmpty. Operand 10628 states and 32594 transitions. [2019-12-19 00:32:42,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-19 00:32:42,156 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:42,156 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] [2019-12-19 00:32:42,156 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:42,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:42,156 INFO L82 PathProgramCache]: Analyzing trace with hash -541236016, now seen corresponding path program 1 times [2019-12-19 00:32:42,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:42,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681033446] [2019-12-19 00:32:42,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:42,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:42,253 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 00:32:42,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681033446] [2019-12-19 00:32:42,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:42,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 00:32:42,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750122435] [2019-12-19 00:32:42,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 00:32:42,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:42,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 00:32:42,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:32:42,256 INFO L87 Difference]: Start difference. First operand 10628 states and 32594 transitions. Second operand 6 states. [2019-12-19 00:32:42,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:42,748 INFO L93 Difference]: Finished difference Result 13185 states and 39875 transitions. [2019-12-19 00:32:42,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 00:32:42,749 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-19 00:32:42,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:42,776 INFO L225 Difference]: With dead ends: 13185 [2019-12-19 00:32:42,777 INFO L226 Difference]: Without dead ends: 13122 [2019-12-19 00:32:42,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-12-19 00:32:42,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13122 states. [2019-12-19 00:32:42,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13122 to 11051. [2019-12-19 00:32:42,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11051 states. [2019-12-19 00:32:42,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11051 states to 11051 states and 33788 transitions. [2019-12-19 00:32:42,989 INFO L78 Accepts]: Start accepts. Automaton has 11051 states and 33788 transitions. Word has length 56 [2019-12-19 00:32:42,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:42,989 INFO L462 AbstractCegarLoop]: Abstraction has 11051 states and 33788 transitions. [2019-12-19 00:32:42,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 00:32:42,989 INFO L276 IsEmpty]: Start isEmpty. Operand 11051 states and 33788 transitions. [2019-12-19 00:32:42,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-19 00:32:42,993 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:42,994 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 00:32:42,994 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:42,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:42,994 INFO L82 PathProgramCache]: Analyzing trace with hash 227053228, now seen corresponding path program 1 times [2019-12-19 00:32:42,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:42,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092048238] [2019-12-19 00:32:42,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:43,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:43,049 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 00:32:43,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092048238] [2019-12-19 00:32:43,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:43,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 00:32:43,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186260809] [2019-12-19 00:32:43,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 00:32:43,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:43,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 00:32:43,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 00:32:43,051 INFO L87 Difference]: Start difference. First operand 11051 states and 33788 transitions. Second operand 4 states. [2019-12-19 00:32:43,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:43,187 INFO L93 Difference]: Finished difference Result 12865 states and 39394 transitions. [2019-12-19 00:32:43,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 00:32:43,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-12-19 00:32:43,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:43,206 INFO L225 Difference]: With dead ends: 12865 [2019-12-19 00:32:43,206 INFO L226 Difference]: Without dead ends: 12865 [2019-12-19 00:32:43,207 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 00:32:43,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12865 states. [2019-12-19 00:32:43,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12865 to 11696. [2019-12-19 00:32:43,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11696 states. [2019-12-19 00:32:43,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11696 states to 11696 states and 35765 transitions. [2019-12-19 00:32:43,372 INFO L78 Accepts]: Start accepts. Automaton has 11696 states and 35765 transitions. Word has length 64 [2019-12-19 00:32:43,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:43,372 INFO L462 AbstractCegarLoop]: Abstraction has 11696 states and 35765 transitions. [2019-12-19 00:32:43,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 00:32:43,372 INFO L276 IsEmpty]: Start isEmpty. Operand 11696 states and 35765 transitions. [2019-12-19 00:32:43,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-19 00:32:43,376 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:43,376 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 00:32:43,376 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:43,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:43,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1969863563, now seen corresponding path program 1 times [2019-12-19 00:32:43,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:43,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924387037] [2019-12-19 00:32:43,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:43,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:43,470 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 00:32:43,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924387037] [2019-12-19 00:32:43,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:43,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 00:32:43,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112778481] [2019-12-19 00:32:43,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 00:32:43,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:43,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 00:32:43,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:32:43,472 INFO L87 Difference]: Start difference. First operand 11696 states and 35765 transitions. Second operand 6 states. [2019-12-19 00:32:43,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:43,956 INFO L93 Difference]: Finished difference Result 14222 states and 42863 transitions. [2019-12-19 00:32:43,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 00:32:43,957 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-12-19 00:32:43,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:43,977 INFO L225 Difference]: With dead ends: 14222 [2019-12-19 00:32:43,977 INFO L226 Difference]: Without dead ends: 14161 [2019-12-19 00:32:43,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-19 00:32:44,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14161 states. [2019-12-19 00:32:44,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14161 to 13464. [2019-12-19 00:32:44,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13464 states. [2019-12-19 00:32:44,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13464 states to 13464 states and 40782 transitions. [2019-12-19 00:32:44,330 INFO L78 Accepts]: Start accepts. Automaton has 13464 states and 40782 transitions. Word has length 64 [2019-12-19 00:32:44,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:44,331 INFO L462 AbstractCegarLoop]: Abstraction has 13464 states and 40782 transitions. [2019-12-19 00:32:44,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 00:32:44,331 INFO L276 IsEmpty]: Start isEmpty. Operand 13464 states and 40782 transitions. [2019-12-19 00:32:44,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 00:32:44,339 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:44,339 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:32:44,339 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:44,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:44,340 INFO L82 PathProgramCache]: Analyzing trace with hash -509623810, now seen corresponding path program 1 times [2019-12-19 00:32:44,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:44,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157299337] [2019-12-19 00:32:44,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:44,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:44,398 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 00:32:44,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157299337] [2019-12-19 00:32:44,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:44,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 00:32:44,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891823468] [2019-12-19 00:32:44,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 00:32:44,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:44,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 00:32:44,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 00:32:44,401 INFO L87 Difference]: Start difference. First operand 13464 states and 40782 transitions. Second operand 4 states. [2019-12-19 00:32:44,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:44,750 INFO L93 Difference]: Finished difference Result 16506 states and 49374 transitions. [2019-12-19 00:32:44,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 00:32:44,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-12-19 00:32:44,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:44,784 INFO L225 Difference]: With dead ends: 16506 [2019-12-19 00:32:44,784 INFO L226 Difference]: Without dead ends: 16506 [2019-12-19 00:32:44,784 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 00:32:44,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16506 states. [2019-12-19 00:32:45,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16506 to 14985. [2019-12-19 00:32:45,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14985 states. [2019-12-19 00:32:45,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14985 states to 14985 states and 44963 transitions. [2019-12-19 00:32:45,120 INFO L78 Accepts]: Start accepts. Automaton has 14985 states and 44963 transitions. Word has length 68 [2019-12-19 00:32:45,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:45,120 INFO L462 AbstractCegarLoop]: Abstraction has 14985 states and 44963 transitions. [2019-12-19 00:32:45,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 00:32:45,120 INFO L276 IsEmpty]: Start isEmpty. Operand 14985 states and 44963 transitions. [2019-12-19 00:32:45,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 00:32:45,131 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:45,131 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:32:45,131 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:45,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:45,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1708134143, now seen corresponding path program 1 times [2019-12-19 00:32:45,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:45,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692287697] [2019-12-19 00:32:45,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:45,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:45,170 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 00:32:45,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692287697] [2019-12-19 00:32:45,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:45,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 00:32:45,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510447716] [2019-12-19 00:32:45,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 00:32:45,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:45,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 00:32:45,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 00:32:45,172 INFO L87 Difference]: Start difference. First operand 14985 states and 44963 transitions. Second operand 3 states. [2019-12-19 00:32:45,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:45,453 INFO L93 Difference]: Finished difference Result 15533 states and 46406 transitions. [2019-12-19 00:32:45,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 00:32:45,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-12-19 00:32:45,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:45,484 INFO L225 Difference]: With dead ends: 15533 [2019-12-19 00:32:45,484 INFO L226 Difference]: Without dead ends: 15533 [2019-12-19 00:32:45,484 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 00:32:45,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15533 states. [2019-12-19 00:32:45,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15533 to 15279. [2019-12-19 00:32:45,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15279 states. [2019-12-19 00:32:45,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15279 states to 15279 states and 45731 transitions. [2019-12-19 00:32:45,762 INFO L78 Accepts]: Start accepts. Automaton has 15279 states and 45731 transitions. Word has length 68 [2019-12-19 00:32:45,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:45,762 INFO L462 AbstractCegarLoop]: Abstraction has 15279 states and 45731 transitions. [2019-12-19 00:32:45,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 00:32:45,762 INFO L276 IsEmpty]: Start isEmpty. Operand 15279 states and 45731 transitions. [2019-12-19 00:32:45,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-19 00:32:45,771 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:45,771 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] [2019-12-19 00:32:45,771 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:45,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:45,771 INFO L82 PathProgramCache]: Analyzing trace with hash 387298804, now seen corresponding path program 1 times [2019-12-19 00:32:45,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:45,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717511876] [2019-12-19 00:32:45,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:45,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:45,867 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 00:32:45,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717511876] [2019-12-19 00:32:45,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:45,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 00:32:45,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743682773] [2019-12-19 00:32:45,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 00:32:45,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:45,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 00:32:45,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:32:45,869 INFO L87 Difference]: Start difference. First operand 15279 states and 45731 transitions. Second operand 6 states. [2019-12-19 00:32:46,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:46,461 INFO L93 Difference]: Finished difference Result 16276 states and 48106 transitions. [2019-12-19 00:32:46,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 00:32:46,461 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-12-19 00:32:46,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:46,485 INFO L225 Difference]: With dead ends: 16276 [2019-12-19 00:32:46,485 INFO L226 Difference]: Without dead ends: 16276 [2019-12-19 00:32:46,485 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 00:32:46,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16276 states. [2019-12-19 00:32:46,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16276 to 15852. [2019-12-19 00:32:46,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15852 states. [2019-12-19 00:32:46,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15852 states to 15852 states and 47028 transitions. [2019-12-19 00:32:46,847 INFO L78 Accepts]: Start accepts. Automaton has 15852 states and 47028 transitions. Word has length 70 [2019-12-19 00:32:46,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:46,848 INFO L462 AbstractCegarLoop]: Abstraction has 15852 states and 47028 transitions. [2019-12-19 00:32:46,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 00:32:46,848 INFO L276 IsEmpty]: Start isEmpty. Operand 15852 states and 47028 transitions. [2019-12-19 00:32:46,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-19 00:32:46,857 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:46,857 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] [2019-12-19 00:32:46,857 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:46,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:46,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1689910539, now seen corresponding path program 1 times [2019-12-19 00:32:46,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:46,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735085109] [2019-12-19 00:32:46,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:46,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:46,973 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 00:32:46,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735085109] [2019-12-19 00:32:46,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:46,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 00:32:46,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120806617] [2019-12-19 00:32:46,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 00:32:46,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:46,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 00:32:46,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:32:46,975 INFO L87 Difference]: Start difference. First operand 15852 states and 47028 transitions. Second operand 6 states. [2019-12-19 00:32:47,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:47,420 INFO L93 Difference]: Finished difference Result 18163 states and 52356 transitions. [2019-12-19 00:32:47,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 00:32:47,420 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-12-19 00:32:47,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:47,454 INFO L225 Difference]: With dead ends: 18163 [2019-12-19 00:32:47,454 INFO L226 Difference]: Without dead ends: 18163 [2019-12-19 00:32:47,455 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 00:32:47,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18163 states. [2019-12-19 00:32:47,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18163 to 16544. [2019-12-19 00:32:47,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16544 states. [2019-12-19 00:32:47,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16544 states to 16544 states and 48248 transitions. [2019-12-19 00:32:47,686 INFO L78 Accepts]: Start accepts. Automaton has 16544 states and 48248 transitions. Word has length 70 [2019-12-19 00:32:47,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:47,686 INFO L462 AbstractCegarLoop]: Abstraction has 16544 states and 48248 transitions. [2019-12-19 00:32:47,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 00:32:47,686 INFO L276 IsEmpty]: Start isEmpty. Operand 16544 states and 48248 transitions. [2019-12-19 00:32:47,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-19 00:32:47,696 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:47,697 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] [2019-12-19 00:32:47,697 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:47,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:47,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1478559626, now seen corresponding path program 1 times [2019-12-19 00:32:47,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:47,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354643964] [2019-12-19 00:32:47,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:47,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:47,755 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 00:32:47,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354643964] [2019-12-19 00:32:47,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:47,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 00:32:47,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481780707] [2019-12-19 00:32:47,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 00:32:47,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:47,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 00:32:47,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:32:47,758 INFO L87 Difference]: Start difference. First operand 16544 states and 48248 transitions. Second operand 5 states. [2019-12-19 00:32:48,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:48,321 INFO L93 Difference]: Finished difference Result 22580 states and 65579 transitions. [2019-12-19 00:32:48,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 00:32:48,321 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-12-19 00:32:48,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:48,363 INFO L225 Difference]: With dead ends: 22580 [2019-12-19 00:32:48,364 INFO L226 Difference]: Without dead ends: 22580 [2019-12-19 00:32:48,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 00:32:48,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22580 states. [2019-12-19 00:32:48,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22580 to 17714. [2019-12-19 00:32:48,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17714 states. [2019-12-19 00:32:48,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17714 states to 17714 states and 51596 transitions. [2019-12-19 00:32:48,695 INFO L78 Accepts]: Start accepts. Automaton has 17714 states and 51596 transitions. Word has length 70 [2019-12-19 00:32:48,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:48,695 INFO L462 AbstractCegarLoop]: Abstraction has 17714 states and 51596 transitions. [2019-12-19 00:32:48,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 00:32:48,695 INFO L276 IsEmpty]: Start isEmpty. Operand 17714 states and 51596 transitions. [2019-12-19 00:32:48,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-19 00:32:48,706 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:48,706 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] [2019-12-19 00:32:48,706 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:48,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:48,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1008953207, now seen corresponding path program 1 times [2019-12-19 00:32:48,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:48,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710835430] [2019-12-19 00:32:48,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:48,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:48,753 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 00:32:48,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710835430] [2019-12-19 00:32:48,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:48,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 00:32:48,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809368168] [2019-12-19 00:32:48,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 00:32:48,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:48,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 00:32:48,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 00:32:48,756 INFO L87 Difference]: Start difference. First operand 17714 states and 51596 transitions. Second operand 4 states. [2019-12-19 00:32:49,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:49,415 INFO L93 Difference]: Finished difference Result 24941 states and 73085 transitions. [2019-12-19 00:32:49,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 00:32:49,415 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-12-19 00:32:49,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:49,452 INFO L225 Difference]: With dead ends: 24941 [2019-12-19 00:32:49,452 INFO L226 Difference]: Without dead ends: 24806 [2019-12-19 00:32:49,452 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 00:32:49,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24806 states. [2019-12-19 00:32:49,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24806 to 22748. [2019-12-19 00:32:49,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22748 states. [2019-12-19 00:32:49,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22748 states to 22748 states and 66715 transitions. [2019-12-19 00:32:49,896 INFO L78 Accepts]: Start accepts. Automaton has 22748 states and 66715 transitions. Word has length 70 [2019-12-19 00:32:49,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:49,897 INFO L462 AbstractCegarLoop]: Abstraction has 22748 states and 66715 transitions. [2019-12-19 00:32:49,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 00:32:49,897 INFO L276 IsEmpty]: Start isEmpty. Operand 22748 states and 66715 transitions. [2019-12-19 00:32:49,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-19 00:32:49,908 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:49,908 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] [2019-12-19 00:32:49,909 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:49,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:49,909 INFO L82 PathProgramCache]: Analyzing trace with hash -787998152, now seen corresponding path program 1 times [2019-12-19 00:32:49,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:49,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646573151] [2019-12-19 00:32:49,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:49,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:50,031 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 00:32:50,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646573151] [2019-12-19 00:32:50,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:50,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 00:32:50,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295731410] [2019-12-19 00:32:50,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 00:32:50,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:50,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 00:32:50,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-19 00:32:50,033 INFO L87 Difference]: Start difference. First operand 22748 states and 66715 transitions. Second operand 7 states. [2019-12-19 00:32:50,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:50,602 INFO L93 Difference]: Finished difference Result 19571 states and 54510 transitions. [2019-12-19 00:32:50,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 00:32:50,603 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-12-19 00:32:50,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:50,631 INFO L225 Difference]: With dead ends: 19571 [2019-12-19 00:32:50,631 INFO L226 Difference]: Without dead ends: 19571 [2019-12-19 00:32:50,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-12-19 00:32:50,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19571 states. [2019-12-19 00:32:50,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19571 to 16689. [2019-12-19 00:32:50,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16689 states. [2019-12-19 00:32:50,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16689 states to 16689 states and 46333 transitions. [2019-12-19 00:32:50,880 INFO L78 Accepts]: Start accepts. Automaton has 16689 states and 46333 transitions. Word has length 70 [2019-12-19 00:32:50,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:50,880 INFO L462 AbstractCegarLoop]: Abstraction has 16689 states and 46333 transitions. [2019-12-19 00:32:50,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 00:32:50,880 INFO L276 IsEmpty]: Start isEmpty. Operand 16689 states and 46333 transitions. [2019-12-19 00:32:50,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-19 00:32:50,887 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:50,887 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] [2019-12-19 00:32:50,887 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:50,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:50,888 INFO L82 PathProgramCache]: Analyzing trace with hash 99505529, now seen corresponding path program 1 times [2019-12-19 00:32:50,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:50,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683119921] [2019-12-19 00:32:50,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:50,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:50,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 00:32:50,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683119921] [2019-12-19 00:32:50,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:50,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 00:32:50,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025002064] [2019-12-19 00:32:50,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 00:32:50,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:50,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 00:32:50,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:32:50,963 INFO L87 Difference]: Start difference. First operand 16689 states and 46333 transitions. Second operand 5 states. [2019-12-19 00:32:51,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:51,013 INFO L93 Difference]: Finished difference Result 5337 states and 12605 transitions. [2019-12-19 00:32:51,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 00:32:51,013 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-12-19 00:32:51,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:51,020 INFO L225 Difference]: With dead ends: 5337 [2019-12-19 00:32:51,020 INFO L226 Difference]: Without dead ends: 4650 [2019-12-19 00:32:51,021 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 00:32:51,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4650 states. [2019-12-19 00:32:51,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4650 to 4325. [2019-12-19 00:32:51,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4325 states. [2019-12-19 00:32:51,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4325 states to 4325 states and 9952 transitions. [2019-12-19 00:32:51,066 INFO L78 Accepts]: Start accepts. Automaton has 4325 states and 9952 transitions. Word has length 70 [2019-12-19 00:32:51,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:51,067 INFO L462 AbstractCegarLoop]: Abstraction has 4325 states and 9952 transitions. [2019-12-19 00:32:51,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 00:32:51,067 INFO L276 IsEmpty]: Start isEmpty. Operand 4325 states and 9952 transitions. [2019-12-19 00:32:51,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-19 00:32:51,070 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:51,070 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] [2019-12-19 00:32:51,071 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:51,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:51,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1027808388, now seen corresponding path program 1 times [2019-12-19 00:32:51,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:51,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15899945] [2019-12-19 00:32:51,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:51,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:51,107 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 00:32:51,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15899945] [2019-12-19 00:32:51,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:51,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 00:32:51,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487841741] [2019-12-19 00:32:51,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 00:32:51,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:51,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 00:32:51,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 00:32:51,109 INFO L87 Difference]: Start difference. First operand 4325 states and 9952 transitions. Second operand 3 states. [2019-12-19 00:32:51,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:51,147 INFO L93 Difference]: Finished difference Result 5345 states and 12117 transitions. [2019-12-19 00:32:51,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 00:32:51,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-12-19 00:32:51,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:51,154 INFO L225 Difference]: With dead ends: 5345 [2019-12-19 00:32:51,154 INFO L226 Difference]: Without dead ends: 5345 [2019-12-19 00:32:51,155 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 00:32:51,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5345 states. [2019-12-19 00:32:51,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5345 to 4260. [2019-12-19 00:32:51,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4260 states. [2019-12-19 00:32:51,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4260 states to 4260 states and 9560 transitions. [2019-12-19 00:32:51,225 INFO L78 Accepts]: Start accepts. Automaton has 4260 states and 9560 transitions. Word has length 70 [2019-12-19 00:32:51,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:51,226 INFO L462 AbstractCegarLoop]: Abstraction has 4260 states and 9560 transitions. [2019-12-19 00:32:51,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 00:32:51,226 INFO L276 IsEmpty]: Start isEmpty. Operand 4260 states and 9560 transitions. [2019-12-19 00:32:51,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-19 00:32:51,233 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:51,234 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] [2019-12-19 00:32:51,234 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:51,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:51,234 INFO L82 PathProgramCache]: Analyzing trace with hash -812209841, now seen corresponding path program 1 times [2019-12-19 00:32:51,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:51,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517808496] [2019-12-19 00:32:51,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:51,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:51,304 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 00:32:51,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517808496] [2019-12-19 00:32:51,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:51,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 00:32:51,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006818900] [2019-12-19 00:32:51,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 00:32:51,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:51,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 00:32:51,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:32:51,306 INFO L87 Difference]: Start difference. First operand 4260 states and 9560 transitions. Second operand 5 states. [2019-12-19 00:32:51,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:51,498 INFO L93 Difference]: Finished difference Result 5299 states and 11944 transitions. [2019-12-19 00:32:51,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 00:32:51,499 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-12-19 00:32:51,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:51,509 INFO L225 Difference]: With dead ends: 5299 [2019-12-19 00:32:51,509 INFO L226 Difference]: Without dead ends: 5299 [2019-12-19 00:32:51,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-19 00:32:51,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5299 states. [2019-12-19 00:32:51,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5299 to 4888. [2019-12-19 00:32:51,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4888 states. [2019-12-19 00:32:51,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4888 states to 4888 states and 10968 transitions. [2019-12-19 00:32:51,610 INFO L78 Accepts]: Start accepts. Automaton has 4888 states and 10968 transitions. Word has length 76 [2019-12-19 00:32:51,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:51,610 INFO L462 AbstractCegarLoop]: Abstraction has 4888 states and 10968 transitions. [2019-12-19 00:32:51,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 00:32:51,611 INFO L276 IsEmpty]: Start isEmpty. Operand 4888 states and 10968 transitions. [2019-12-19 00:32:51,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-19 00:32:51,617 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:51,617 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] [2019-12-19 00:32:51,617 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:51,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:51,618 INFO L82 PathProgramCache]: Analyzing trace with hash 930600494, now seen corresponding path program 1 times [2019-12-19 00:32:51,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:51,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911648782] [2019-12-19 00:32:51,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:51,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:51,721 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 00:32:51,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911648782] [2019-12-19 00:32:51,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:51,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 00:32:51,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237610796] [2019-12-19 00:32:51,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 00:32:51,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:51,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 00:32:51,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 00:32:51,725 INFO L87 Difference]: Start difference. First operand 4888 states and 10968 transitions. Second operand 7 states. [2019-12-19 00:32:52,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:52,212 INFO L93 Difference]: Finished difference Result 5520 states and 12289 transitions. [2019-12-19 00:32:52,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 00:32:52,213 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2019-12-19 00:32:52,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:52,220 INFO L225 Difference]: With dead ends: 5520 [2019-12-19 00:32:52,220 INFO L226 Difference]: Without dead ends: 5467 [2019-12-19 00:32:52,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-12-19 00:32:52,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5467 states. [2019-12-19 00:32:52,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5467 to 4912. [2019-12-19 00:32:52,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4912 states. [2019-12-19 00:32:52,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4912 states to 4912 states and 10945 transitions. [2019-12-19 00:32:52,297 INFO L78 Accepts]: Start accepts. Automaton has 4912 states and 10945 transitions. Word has length 76 [2019-12-19 00:32:52,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:52,297 INFO L462 AbstractCegarLoop]: Abstraction has 4912 states and 10945 transitions. [2019-12-19 00:32:52,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 00:32:52,298 INFO L276 IsEmpty]: Start isEmpty. Operand 4912 states and 10945 transitions. [2019-12-19 00:32:52,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 00:32:52,305 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:52,305 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:32:52,305 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:52,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:52,306 INFO L82 PathProgramCache]: Analyzing trace with hash 513999619, now seen corresponding path program 1 times [2019-12-19 00:32:52,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:52,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874965694] [2019-12-19 00:32:52,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:52,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:52,387 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 00:32:52,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874965694] [2019-12-19 00:32:52,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:52,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 00:32:52,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50547670] [2019-12-19 00:32:52,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 00:32:52,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:52,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 00:32:52,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 00:32:52,390 INFO L87 Difference]: Start difference. First operand 4912 states and 10945 transitions. Second operand 4 states. [2019-12-19 00:32:52,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:52,500 INFO L93 Difference]: Finished difference Result 5854 states and 12960 transitions. [2019-12-19 00:32:52,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 00:32:52,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-19 00:32:52,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:52,508 INFO L225 Difference]: With dead ends: 5854 [2019-12-19 00:32:52,508 INFO L226 Difference]: Without dead ends: 5854 [2019-12-19 00:32:52,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:32:52,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5854 states. [2019-12-19 00:32:52,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5854 to 5244. [2019-12-19 00:32:52,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5244 states. [2019-12-19 00:32:52,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5244 states to 5244 states and 11647 transitions. [2019-12-19 00:32:52,577 INFO L78 Accepts]: Start accepts. Automaton has 5244 states and 11647 transitions. Word has length 97 [2019-12-19 00:32:52,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:52,577 INFO L462 AbstractCegarLoop]: Abstraction has 5244 states and 11647 transitions. [2019-12-19 00:32:52,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 00:32:52,577 INFO L276 IsEmpty]: Start isEmpty. Operand 5244 states and 11647 transitions. [2019-12-19 00:32:52,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-19 00:32:52,582 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:52,582 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:32:52,582 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:52,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:52,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1028011755, now seen corresponding path program 1 times [2019-12-19 00:32:52,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:52,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773274156] [2019-12-19 00:32:52,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:52,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:52,698 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 00:32:52,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773274156] [2019-12-19 00:32:52,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:52,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 00:32:52,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471947711] [2019-12-19 00:32:52,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 00:32:52,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:52,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 00:32:52,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:32:52,700 INFO L87 Difference]: Start difference. First operand 5244 states and 11647 transitions. Second operand 6 states. [2019-12-19 00:32:53,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:53,424 INFO L93 Difference]: Finished difference Result 7912 states and 17668 transitions. [2019-12-19 00:32:53,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 00:32:53,424 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-12-19 00:32:53,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:53,433 INFO L225 Difference]: With dead ends: 7912 [2019-12-19 00:32:53,434 INFO L226 Difference]: Without dead ends: 7912 [2019-12-19 00:32:53,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-12-19 00:32:53,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7912 states. [2019-12-19 00:32:53,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7912 to 6039. [2019-12-19 00:32:53,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6039 states. [2019-12-19 00:32:53,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6039 states to 6039 states and 13543 transitions. [2019-12-19 00:32:53,510 INFO L78 Accepts]: Start accepts. Automaton has 6039 states and 13543 transitions. Word has length 99 [2019-12-19 00:32:53,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:53,510 INFO L462 AbstractCegarLoop]: Abstraction has 6039 states and 13543 transitions. [2019-12-19 00:32:53,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 00:32:53,510 INFO L276 IsEmpty]: Start isEmpty. Operand 6039 states and 13543 transitions. [2019-12-19 00:32:53,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-19 00:32:53,516 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:53,516 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:32:53,516 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:53,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:53,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1016695628, now seen corresponding path program 1 times [2019-12-19 00:32:53,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:53,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323596995] [2019-12-19 00:32:53,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:53,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:53,610 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 00:32:53,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323596995] [2019-12-19 00:32:53,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:53,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 00:32:53,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849087568] [2019-12-19 00:32:53,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 00:32:53,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:53,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 00:32:53,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 00:32:53,612 INFO L87 Difference]: Start difference. First operand 6039 states and 13543 transitions. Second operand 7 states. [2019-12-19 00:32:54,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:54,845 INFO L93 Difference]: Finished difference Result 8510 states and 18883 transitions. [2019-12-19 00:32:54,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-19 00:32:54,845 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2019-12-19 00:32:54,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:54,856 INFO L225 Difference]: With dead ends: 8510 [2019-12-19 00:32:54,856 INFO L226 Difference]: Without dead ends: 8430 [2019-12-19 00:32:54,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-12-19 00:32:54,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8430 states. [2019-12-19 00:32:54,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8430 to 7002. [2019-12-19 00:32:54,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7002 states. [2019-12-19 00:32:54,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7002 states to 7002 states and 15651 transitions. [2019-12-19 00:32:54,944 INFO L78 Accepts]: Start accepts. Automaton has 7002 states and 15651 transitions. Word has length 99 [2019-12-19 00:32:54,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:54,944 INFO L462 AbstractCegarLoop]: Abstraction has 7002 states and 15651 transitions. [2019-12-19 00:32:54,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 00:32:54,944 INFO L276 IsEmpty]: Start isEmpty. Operand 7002 states and 15651 transitions. [2019-12-19 00:32:54,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-19 00:32:54,953 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:54,954 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:32:54,954 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:54,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:54,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1201062325, now seen corresponding path program 1 times [2019-12-19 00:32:54,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:54,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459639237] [2019-12-19 00:32:54,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:54,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:55,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 00:32:55,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459639237] [2019-12-19 00:32:55,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:55,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 00:32:55,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405943819] [2019-12-19 00:32:55,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 00:32:55,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:55,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 00:32:55,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:32:55,082 INFO L87 Difference]: Start difference. First operand 7002 states and 15651 transitions. Second operand 6 states. [2019-12-19 00:32:55,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:55,305 INFO L93 Difference]: Finished difference Result 6225 states and 13653 transitions. [2019-12-19 00:32:55,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 00:32:55,306 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-12-19 00:32:55,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:55,313 INFO L225 Difference]: With dead ends: 6225 [2019-12-19 00:32:55,313 INFO L226 Difference]: Without dead ends: 6189 [2019-12-19 00:32:55,313 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 00:32:55,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6189 states. [2019-12-19 00:32:55,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6189 to 5424. [2019-12-19 00:32:55,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5424 states. [2019-12-19 00:32:55,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5424 states to 5424 states and 11934 transitions. [2019-12-19 00:32:55,371 INFO L78 Accepts]: Start accepts. Automaton has 5424 states and 11934 transitions. Word has length 99 [2019-12-19 00:32:55,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:55,371 INFO L462 AbstractCegarLoop]: Abstraction has 5424 states and 11934 transitions. [2019-12-19 00:32:55,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 00:32:55,371 INFO L276 IsEmpty]: Start isEmpty. Operand 5424 states and 11934 transitions. [2019-12-19 00:32:55,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-19 00:32:55,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:55,379 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:32:55,379 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:55,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:55,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1192417937, now seen corresponding path program 1 times [2019-12-19 00:32:55,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:55,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734304560] [2019-12-19 00:32:55,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:55,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:55,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 00:32:55,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734304560] [2019-12-19 00:32:55,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:55,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 00:32:55,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350390025] [2019-12-19 00:32:55,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 00:32:55,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:55,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 00:32:55,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:32:55,442 INFO L87 Difference]: Start difference. First operand 5424 states and 11934 transitions. Second operand 5 states. [2019-12-19 00:32:55,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:55,567 INFO L93 Difference]: Finished difference Result 5914 states and 12996 transitions. [2019-12-19 00:32:55,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 00:32:55,568 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-12-19 00:32:55,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:55,575 INFO L225 Difference]: With dead ends: 5914 [2019-12-19 00:32:55,575 INFO L226 Difference]: Without dead ends: 5914 [2019-12-19 00:32:55,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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 00:32:55,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5914 states. [2019-12-19 00:32:55,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5914 to 4663. [2019-12-19 00:32:55,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4663 states. [2019-12-19 00:32:55,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4663 states to 4663 states and 10258 transitions. [2019-12-19 00:32:55,649 INFO L78 Accepts]: Start accepts. Automaton has 4663 states and 10258 transitions. Word has length 99 [2019-12-19 00:32:55,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:55,649 INFO L462 AbstractCegarLoop]: Abstraction has 4663 states and 10258 transitions. [2019-12-19 00:32:55,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 00:32:55,649 INFO L276 IsEmpty]: Start isEmpty. Operand 4663 states and 10258 transitions. [2019-12-19 00:32:55,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-19 00:32:55,655 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:55,655 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:32:55,655 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:55,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:55,656 INFO L82 PathProgramCache]: Analyzing trace with hash -2077057360, now seen corresponding path program 1 times [2019-12-19 00:32:55,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:55,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169927480] [2019-12-19 00:32:55,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:55,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:55,739 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 00:32:55,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169927480] [2019-12-19 00:32:55,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:55,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 00:32:55,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11335315] [2019-12-19 00:32:55,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 00:32:55,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:55,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 00:32:55,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:32:55,741 INFO L87 Difference]: Start difference. First operand 4663 states and 10258 transitions. Second operand 5 states. [2019-12-19 00:32:56,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:56,259 INFO L93 Difference]: Finished difference Result 5588 states and 12229 transitions. [2019-12-19 00:32:56,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 00:32:56,260 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-12-19 00:32:56,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:56,270 INFO L225 Difference]: With dead ends: 5588 [2019-12-19 00:32:56,270 INFO L226 Difference]: Without dead ends: 5528 [2019-12-19 00:32:56,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 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 00:32:56,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5528 states. [2019-12-19 00:32:56,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5528 to 5222. [2019-12-19 00:32:56,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5222 states. [2019-12-19 00:32:56,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5222 states to 5222 states and 11466 transitions. [2019-12-19 00:32:56,380 INFO L78 Accepts]: Start accepts. Automaton has 5222 states and 11466 transitions. Word has length 99 [2019-12-19 00:32:56,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:56,380 INFO L462 AbstractCegarLoop]: Abstraction has 5222 states and 11466 transitions. [2019-12-19 00:32:56,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 00:32:56,381 INFO L276 IsEmpty]: Start isEmpty. Operand 5222 states and 11466 transitions. [2019-12-19 00:32:56,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-19 00:32:56,390 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:56,390 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:32:56,390 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:56,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:56,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1963173391, now seen corresponding path program 1 times [2019-12-19 00:32:56,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:56,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256970148] [2019-12-19 00:32:56,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:56,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:56,475 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 00:32:56,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256970148] [2019-12-19 00:32:56,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:56,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 00:32:56,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236786567] [2019-12-19 00:32:56,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 00:32:56,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:56,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 00:32:56,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:32:56,478 INFO L87 Difference]: Start difference. First operand 5222 states and 11466 transitions. Second operand 5 states. [2019-12-19 00:32:56,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:56,721 INFO L93 Difference]: Finished difference Result 6154 states and 13387 transitions. [2019-12-19 00:32:56,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 00:32:56,721 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-12-19 00:32:56,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:56,729 INFO L225 Difference]: With dead ends: 6154 [2019-12-19 00:32:56,729 INFO L226 Difference]: Without dead ends: 6096 [2019-12-19 00:32:56,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 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 00:32:56,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6096 states. [2019-12-19 00:32:56,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6096 to 4963. [2019-12-19 00:32:56,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4963 states. [2019-12-19 00:32:56,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4963 states to 4963 states and 10944 transitions. [2019-12-19 00:32:56,814 INFO L78 Accepts]: Start accepts. Automaton has 4963 states and 10944 transitions. Word has length 99 [2019-12-19 00:32:56,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:56,814 INFO L462 AbstractCegarLoop]: Abstraction has 4963 states and 10944 transitions. [2019-12-19 00:32:56,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 00:32:56,815 INFO L276 IsEmpty]: Start isEmpty. Operand 4963 states and 10944 transitions. [2019-12-19 00:32:56,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-19 00:32:56,821 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:56,821 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:32:56,821 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:56,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:56,822 INFO L82 PathProgramCache]: Analyzing trace with hash 579065745, now seen corresponding path program 2 times [2019-12-19 00:32:56,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:56,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712206010] [2019-12-19 00:32:56,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:56,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:56,923 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 00:32:56,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712206010] [2019-12-19 00:32:56,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:56,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 00:32:56,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193541534] [2019-12-19 00:32:56,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 00:32:56,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:56,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 00:32:56,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:32:56,924 INFO L87 Difference]: Start difference. First operand 4963 states and 10944 transitions. Second operand 6 states. [2019-12-19 00:32:57,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:57,125 INFO L93 Difference]: Finished difference Result 5219 states and 11466 transitions. [2019-12-19 00:32:57,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 00:32:57,125 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-12-19 00:32:57,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:57,131 INFO L225 Difference]: With dead ends: 5219 [2019-12-19 00:32:57,131 INFO L226 Difference]: Without dead ends: 5219 [2019-12-19 00:32:57,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-19 00:32:57,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5219 states. [2019-12-19 00:32:57,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5219 to 4905. [2019-12-19 00:32:57,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4905 states. [2019-12-19 00:32:57,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4905 states to 4905 states and 10818 transitions. [2019-12-19 00:32:57,225 INFO L78 Accepts]: Start accepts. Automaton has 4905 states and 10818 transitions. Word has length 99 [2019-12-19 00:32:57,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:57,225 INFO L462 AbstractCegarLoop]: Abstraction has 4905 states and 10818 transitions. [2019-12-19 00:32:57,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 00:32:57,225 INFO L276 IsEmpty]: Start isEmpty. Operand 4905 states and 10818 transitions. [2019-12-19 00:32:57,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-19 00:32:57,229 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:57,229 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:32:57,229 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:57,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:57,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1461100972, now seen corresponding path program 1 times [2019-12-19 00:32:57,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:57,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58327132] [2019-12-19 00:32:57,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:57,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 00:32:57,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58327132] [2019-12-19 00:32:57,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:57,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 00:32:57,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151456427] [2019-12-19 00:32:57,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 00:32:57,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:57,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 00:32:57,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-19 00:32:57,363 INFO L87 Difference]: Start difference. First operand 4905 states and 10818 transitions. Second operand 8 states. [2019-12-19 00:32:57,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:57,752 INFO L93 Difference]: Finished difference Result 5693 states and 12426 transitions. [2019-12-19 00:32:57,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-19 00:32:57,753 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 99 [2019-12-19 00:32:57,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:57,760 INFO L225 Difference]: With dead ends: 5693 [2019-12-19 00:32:57,760 INFO L226 Difference]: Without dead ends: 5693 [2019-12-19 00:32:57,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-12-19 00:32:57,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5693 states. [2019-12-19 00:32:57,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5693 to 5213. [2019-12-19 00:32:57,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5213 states. [2019-12-19 00:32:57,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5213 states to 5213 states and 11437 transitions. [2019-12-19 00:32:57,835 INFO L78 Accepts]: Start accepts. Automaton has 5213 states and 11437 transitions. Word has length 99 [2019-12-19 00:32:57,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:57,836 INFO L462 AbstractCegarLoop]: Abstraction has 5213 states and 11437 transitions. [2019-12-19 00:32:57,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 00:32:57,836 INFO L276 IsEmpty]: Start isEmpty. Operand 5213 states and 11437 transitions. [2019-12-19 00:32:57,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-19 00:32:57,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:57,840 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:32:57,841 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:57,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:57,841 INFO L82 PathProgramCache]: Analyzing trace with hash -573597291, now seen corresponding path program 1 times [2019-12-19 00:32:57,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:57,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056764597] [2019-12-19 00:32:57,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:57,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:57,940 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 00:32:57,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056764597] [2019-12-19 00:32:57,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:57,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 00:32:57,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264569898] [2019-12-19 00:32:57,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 00:32:57,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:57,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 00:32:57,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 00:32:57,942 INFO L87 Difference]: Start difference. First operand 5213 states and 11437 transitions. Second operand 7 states. [2019-12-19 00:32:58,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:58,046 INFO L93 Difference]: Finished difference Result 8304 states and 18320 transitions. [2019-12-19 00:32:58,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 00:32:58,046 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2019-12-19 00:32:58,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:58,050 INFO L225 Difference]: With dead ends: 8304 [2019-12-19 00:32:58,051 INFO L226 Difference]: Without dead ends: 3273 [2019-12-19 00:32:58,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-19 00:32:58,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3273 states. [2019-12-19 00:32:58,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3273 to 3273. [2019-12-19 00:32:58,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3273 states. [2019-12-19 00:32:58,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3273 states to 3273 states and 7226 transitions. [2019-12-19 00:32:58,097 INFO L78 Accepts]: Start accepts. Automaton has 3273 states and 7226 transitions. Word has length 99 [2019-12-19 00:32:58,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:58,097 INFO L462 AbstractCegarLoop]: Abstraction has 3273 states and 7226 transitions. [2019-12-19 00:32:58,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 00:32:58,097 INFO L276 IsEmpty]: Start isEmpty. Operand 3273 states and 7226 transitions. [2019-12-19 00:32:58,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-19 00:32:58,101 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:58,101 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:32:58,102 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:58,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:58,102 INFO L82 PathProgramCache]: Analyzing trace with hash 790630937, now seen corresponding path program 2 times [2019-12-19 00:32:58,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:58,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178111224] [2019-12-19 00:32:58,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:58,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 00:32:58,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 00:32:58,258 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-19 00:32:58,258 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-19 00:32:58,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 12:32:58 BasicIcfg [2019-12-19 00:32:58,503 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-19 00:32:58,506 INFO L168 Benchmark]: Toolchain (without parser) took 46168.66 ms. Allocated memory was 144.2 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 99.2 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 880.1 MB. Max. memory is 7.1 GB. [2019-12-19 00:32:58,512 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 144.2 MB. Free memory was 119.3 MB in the beginning and 119.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-19 00:32:58,512 INFO L168 Benchmark]: CACSL2BoogieTranslator took 776.37 ms. Allocated memory was 144.2 MB in the beginning and 200.8 MB in the end (delta: 56.6 MB). Free memory was 98.7 MB in the beginning and 154.0 MB in the end (delta: -55.3 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-19 00:32:58,513 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.29 ms. Allocated memory is still 200.8 MB. Free memory was 154.0 MB in the beginning and 151.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-19 00:32:58,513 INFO L168 Benchmark]: Boogie Preprocessor took 67.38 ms. Allocated memory is still 200.8 MB. Free memory was 151.4 MB in the beginning and 148.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-19 00:32:58,513 INFO L168 Benchmark]: RCFGBuilder took 849.51 ms. Allocated memory is still 200.8 MB. Free memory was 148.7 MB in the beginning and 103.8 MB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. [2019-12-19 00:32:58,514 INFO L168 Benchmark]: TraceAbstraction took 44407.57 ms. Allocated memory was 200.8 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 103.8 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 828.1 MB. Max. memory is 7.1 GB. [2019-12-19 00:32:58,516 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.50 ms. Allocated memory is still 144.2 MB. Free memory was 119.3 MB in the beginning and 119.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 776.37 ms. Allocated memory was 144.2 MB in the beginning and 200.8 MB in the end (delta: 56.6 MB). Free memory was 98.7 MB in the beginning and 154.0 MB in the end (delta: -55.3 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.29 ms. Allocated memory is still 200.8 MB. Free memory was 154.0 MB in the beginning and 151.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 67.38 ms. Allocated memory is still 200.8 MB. Free memory was 151.4 MB in the beginning and 148.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 849.51 ms. Allocated memory is still 200.8 MB. Free memory was 148.7 MB in the beginning and 103.8 MB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 44407.57 ms. Allocated memory was 200.8 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 103.8 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 828.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] [L696] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L698] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L700] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L702] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L703] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L704] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L706] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L708] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L710] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L711] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L712] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L713] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L714] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L715] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L716] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0] [L717] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L718] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L719] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0] [L720] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L721] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L722] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L723] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L724] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L725] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L726] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L808] 0 pthread_t t245; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L809] FCALL, FORK 0 pthread_create(&t245, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L730] 1 z$w_buff1 = z$w_buff0 [L731] 1 z$w_buff0 = 1 [L732] 1 z$w_buff1_used = z$w_buff0_used [L733] 1 z$w_buff0_used = (_Bool)1 [L810] 0 pthread_t t246; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] FCALL, FORK 0 pthread_create(&t246, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L735] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L736] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L737] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 [L744] 1 __unbuffered_p0_EAX = x [L747] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 y = 1 [L767] 2 __unbuffered_p1_EAX = y [L770] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L771] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L772] 2 z$flush_delayed = weak$$choice2 [L773] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L775] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L776] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L777] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L750] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L780] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] EXPR 2 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L751] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L752] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L753] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L754] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L782] 2 z = z$flush_delayed ? z$mem_tmp : z [L783] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L786] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L786] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L786] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L786] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L787] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L788] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L788] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L789] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L790] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L790] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L818] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L819] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L819] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L820] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L821] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L821] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L824] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 144 locations, 2 error locations. Result: UNSAFE, OverallTime: 43.9s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 18.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8827 SDtfs, 10398 SDslu, 17444 SDs, 0 SdLazy, 7345 SolverSat, 522 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 294 GetRequests, 81 SyntacticMatches, 18 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71015occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 19.3s AutomataMinimizationTime, 31 MinimizatonAttempts, 65914 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 2405 NumberOfCodeBlocks, 2405 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2275 ConstructedInterpolants, 0 QuantifiedInterpolants, 431655 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...