/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-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi004_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:54:45,043 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:54:45,047 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:54:45,065 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:54:45,065 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:54:45,067 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:54:45,069 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:54:45,079 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:54:45,083 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:54:45,086 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:54:45,088 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:54:45,090 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:54:45,091 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:54:45,093 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:54:45,095 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:54:45,096 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:54:45,098 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:54:45,099 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:54:45,100 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:54:45,105 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:54:45,108 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:54:45,109 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:54:45,110 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:54:45,110 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:54:45,112 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:54:45,112 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:54:45,113 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:54:45,113 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:54:45,114 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:54:45,115 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:54:45,115 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:54:45,116 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:54:45,116 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:54:45,117 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:54:45,118 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:54:45,118 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:54:45,119 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:54:45,119 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:54:45,119 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:54:45,120 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:54:45,121 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:54:45,122 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-VariableLbe-MCR.epf [2019-12-27 21:54:45,135 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:54:45,136 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:54:45,137 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:54:45,137 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:54:45,137 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:54:45,138 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:54:45,138 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:54:45,138 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:54:45,138 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:54:45,138 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:54:45,139 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:54:45,139 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:54:45,139 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:54:45,139 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:54:45,139 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:54:45,140 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:54:45,140 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:54:45,140 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:54:45,140 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:54:45,140 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:54:45,141 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:54:45,141 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:54:45,141 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:54:45,141 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:54:45,141 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:54:45,142 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:54:45,142 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:54:45,142 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:54:45,142 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:54:45,142 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:54:45,143 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:54:45,143 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:54:45,426 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:54:45,440 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:54:45,443 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:54:45,444 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:54:45,445 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:54:45,446 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi004_pso.oepc.i [2019-12-27 21:54:45,518 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3683a1abf/f995ff2631254d7fb5111b9dcc2ff026/FLAGd38427b18 [2019-12-27 21:54:46,067 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:54:46,068 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi004_pso.oepc.i [2019-12-27 21:54:46,086 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3683a1abf/f995ff2631254d7fb5111b9dcc2ff026/FLAGd38427b18 [2019-12-27 21:54:46,324 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3683a1abf/f995ff2631254d7fb5111b9dcc2ff026 [2019-12-27 21:54:46,336 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:54:46,338 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:54:46,341 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:54:46,341 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:54:46,345 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:54:46,346 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:54:46" (1/1) ... [2019-12-27 21:54:46,350 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ece4928 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:46, skipping insertion in model container [2019-12-27 21:54:46,350 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:54:46" (1/1) ... [2019-12-27 21:54:46,359 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:54:46,431 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:54:46,938 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:54:46,950 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:54:47,036 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:54:47,132 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:54:47,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:47 WrapperNode [2019-12-27 21:54:47,133 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:54:47,134 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:54:47,134 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:54:47,134 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:54:47,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:47" (1/1) ... [2019-12-27 21:54:47,161 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:47" (1/1) ... [2019-12-27 21:54:47,191 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:54:47,191 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:54:47,191 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:54:47,191 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:54:47,200 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:47" (1/1) ... [2019-12-27 21:54:47,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:47" (1/1) ... [2019-12-27 21:54:47,205 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:47" (1/1) ... [2019-12-27 21:54:47,205 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:47" (1/1) ... [2019-12-27 21:54:47,216 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:47" (1/1) ... [2019-12-27 21:54:47,221 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:47" (1/1) ... [2019-12-27 21:54:47,224 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:47" (1/1) ... [2019-12-27 21:54:47,229 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:54:47,229 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:54:47,230 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:54:47,230 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:54:47,231 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:54:47,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:54:47,295 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:54:47,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:54:47,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:54:47,296 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:54:47,296 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:54:47,296 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:54:47,296 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:54:47,297 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:54:47,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:54:47,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:54:47,299 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 21:54:47,969 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:54:47,970 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:54:47,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:54:47 BoogieIcfgContainer [2019-12-27 21:54:47,971 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:54:47,973 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:54:47,973 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:54:47,978 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:54:47,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:54:46" (1/3) ... [2019-12-27 21:54:47,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3856c995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:54:47, skipping insertion in model container [2019-12-27 21:54:47,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:47" (2/3) ... [2019-12-27 21:54:47,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3856c995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:54:47, skipping insertion in model container [2019-12-27 21:54:47,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:54:47" (3/3) ... [2019-12-27 21:54:47,985 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi004_pso.oepc.i [2019-12-27 21:54:47,996 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:54:47,997 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:54:48,009 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:54:48,010 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:54:48,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,051 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,051 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,096 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,097 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,097 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,098 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,098 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,122 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,122 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,122 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,128 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,129 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:48,152 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 21:54:48,171 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:54:48,171 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:54:48,171 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:54:48,171 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:54:48,171 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:54:48,172 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:54:48,172 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:54:48,172 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:54:48,190 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 165 transitions [2019-12-27 21:54:48,192 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-12-27 21:54:48,297 INFO L132 PetriNetUnfolder]: 35/163 cut-off events. [2019-12-27 21:54:48,298 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:54:48,311 INFO L76 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 163 events. 35/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 339 event pairs. 0/126 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-27 21:54:48,327 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-12-27 21:54:48,403 INFO L132 PetriNetUnfolder]: 35/163 cut-off events. [2019-12-27 21:54:48,403 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:54:48,411 INFO L76 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 163 events. 35/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 339 event pairs. 0/126 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-27 21:54:48,426 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-27 21:54:48,427 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:54:51,286 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 21:54:51,402 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 21:54:51,452 INFO L206 etLargeBlockEncoding]: Checked pairs total: 41237 [2019-12-27 21:54:51,452 INFO L214 etLargeBlockEncoding]: Total number of compositions: 97 [2019-12-27 21:54:51,455 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 69 places, 81 transitions [2019-12-27 21:54:51,835 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 7504 states. [2019-12-27 21:54:51,838 INFO L276 IsEmpty]: Start isEmpty. Operand 7504 states. [2019-12-27 21:54:51,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 21:54:51,844 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:54:51,845 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 21:54:51,846 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:54:51,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:54:51,853 INFO L82 PathProgramCache]: Analyzing trace with hash 676926397, now seen corresponding path program 1 times [2019-12-27 21:54:51,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:54:51,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092228398] [2019-12-27 21:54:51,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:54:51,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:54:52,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:54:52,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092228398] [2019-12-27 21:54:52,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:54:52,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:54:52,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1070249296] [2019-12-27 21:54:52,083 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:54:52,088 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:54:52,103 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 21:54:52,103 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:54:52,107 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:54:52,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:54:52,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:54:52,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:54:52,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:54:52,125 INFO L87 Difference]: Start difference. First operand 7504 states. Second operand 3 states. [2019-12-27 21:54:52,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:54:52,324 INFO L93 Difference]: Finished difference Result 6863 states and 23135 transitions. [2019-12-27 21:54:52,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:54:52,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 21:54:52,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:54:52,403 INFO L225 Difference]: With dead ends: 6863 [2019-12-27 21:54:52,404 INFO L226 Difference]: Without dead ends: 6460 [2019-12-27 21:54:52,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:54:52,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6460 states. [2019-12-27 21:54:52,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6460 to 6460. [2019-12-27 21:54:52,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6460 states. [2019-12-27 21:54:52,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6460 states to 6460 states and 21739 transitions. [2019-12-27 21:54:52,863 INFO L78 Accepts]: Start accepts. Automaton has 6460 states and 21739 transitions. Word has length 5 [2019-12-27 21:54:52,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:54:52,864 INFO L462 AbstractCegarLoop]: Abstraction has 6460 states and 21739 transitions. [2019-12-27 21:54:52,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:54:52,866 INFO L276 IsEmpty]: Start isEmpty. Operand 6460 states and 21739 transitions. [2019-12-27 21:54:52,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:54:52,876 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:54:52,877 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:54:52,877 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:54:52,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:54:52,878 INFO L82 PathProgramCache]: Analyzing trace with hash 982245482, now seen corresponding path program 1 times [2019-12-27 21:54:52,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:54:52,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672415765] [2019-12-27 21:54:52,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:54:52,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:54:52,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:54:52,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672415765] [2019-12-27 21:54:52,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:54:52,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:54:52,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [875243044] [2019-12-27 21:54:52,994 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:54:52,995 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:54:52,997 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 21:54:52,997 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:54:52,997 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:54:52,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:54:52,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:54:52,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:54:53,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:54:53,000 INFO L87 Difference]: Start difference. First operand 6460 states and 21739 transitions. Second operand 4 states. [2019-12-27 21:54:53,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:54:53,343 INFO L93 Difference]: Finished difference Result 9760 states and 31457 transitions. [2019-12-27 21:54:53,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:54:53,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 21:54:53,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:54:53,411 INFO L225 Difference]: With dead ends: 9760 [2019-12-27 21:54:53,412 INFO L226 Difference]: Without dead ends: 9746 [2019-12-27 21:54:53,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:54:53,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9746 states. [2019-12-27 21:54:54,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9746 to 8836. [2019-12-27 21:54:54,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8836 states. [2019-12-27 21:54:54,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8836 states to 8836 states and 28954 transitions. [2019-12-27 21:54:54,234 INFO L78 Accepts]: Start accepts. Automaton has 8836 states and 28954 transitions. Word has length 11 [2019-12-27 21:54:54,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:54:54,234 INFO L462 AbstractCegarLoop]: Abstraction has 8836 states and 28954 transitions. [2019-12-27 21:54:54,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:54:54,235 INFO L276 IsEmpty]: Start isEmpty. Operand 8836 states and 28954 transitions. [2019-12-27 21:54:54,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 21:54:54,238 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:54:54,238 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:54:54,239 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:54:54,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:54:54,239 INFO L82 PathProgramCache]: Analyzing trace with hash -2066710524, now seen corresponding path program 1 times [2019-12-27 21:54:54,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:54:54,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408979544] [2019-12-27 21:54:54,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:54:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:54:54,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:54:54,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408979544] [2019-12-27 21:54:54,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:54:54,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:54:54,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [656547543] [2019-12-27 21:54:54,348 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:54:54,350 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:54:54,358 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 21:54:54,358 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:54:54,424 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:54:54,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:54:54,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:54:54,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:54:54,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:54:54,426 INFO L87 Difference]: Start difference. First operand 8836 states and 28954 transitions. Second operand 5 states. [2019-12-27 21:54:54,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:54:54,618 INFO L93 Difference]: Finished difference Result 12018 states and 39361 transitions. [2019-12-27 21:54:54,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:54:54,618 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 21:54:54,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:54:54,659 INFO L225 Difference]: With dead ends: 12018 [2019-12-27 21:54:54,660 INFO L226 Difference]: Without dead ends: 12018 [2019-12-27 21:54:54,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:54:54,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12018 states. [2019-12-27 21:54:55,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12018 to 11066. [2019-12-27 21:54:55,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11066 states. [2019-12-27 21:54:55,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11066 states to 11066 states and 36521 transitions. [2019-12-27 21:54:55,172 INFO L78 Accepts]: Start accepts. Automaton has 11066 states and 36521 transitions. Word has length 14 [2019-12-27 21:54:55,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:54:55,173 INFO L462 AbstractCegarLoop]: Abstraction has 11066 states and 36521 transitions. [2019-12-27 21:54:55,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:54:55,174 INFO L276 IsEmpty]: Start isEmpty. Operand 11066 states and 36521 transitions. [2019-12-27 21:54:55,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 21:54:55,176 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:54:55,177 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:54:55,177 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:54:55,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:54:55,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1979542058, now seen corresponding path program 1 times [2019-12-27 21:54:55,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:54:55,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950554018] [2019-12-27 21:54:55,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:54:55,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:54:55,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:54:55,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950554018] [2019-12-27 21:54:55,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:54:55,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:54:55,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [233580829] [2019-12-27 21:54:55,271 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:54:55,273 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:54:55,278 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 21:54:55,278 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:54:55,293 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:54:55,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:54:55,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:54:55,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:54:55,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:54:55,295 INFO L87 Difference]: Start difference. First operand 11066 states and 36521 transitions. Second operand 5 states. [2019-12-27 21:54:55,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:54:55,590 INFO L93 Difference]: Finished difference Result 13296 states and 42892 transitions. [2019-12-27 21:54:55,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:54:55,590 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 21:54:55,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:54:55,633 INFO L225 Difference]: With dead ends: 13296 [2019-12-27 21:54:55,633 INFO L226 Difference]: Without dead ends: 13285 [2019-12-27 21:54:55,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:54:55,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13285 states. [2019-12-27 21:54:55,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13285 to 12030. [2019-12-27 21:54:55,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12030 states. [2019-12-27 21:54:56,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12030 states to 12030 states and 39340 transitions. [2019-12-27 21:54:56,668 INFO L78 Accepts]: Start accepts. Automaton has 12030 states and 39340 transitions. Word has length 14 [2019-12-27 21:54:56,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:54:56,668 INFO L462 AbstractCegarLoop]: Abstraction has 12030 states and 39340 transitions. [2019-12-27 21:54:56,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:54:56,670 INFO L276 IsEmpty]: Start isEmpty. Operand 12030 states and 39340 transitions. [2019-12-27 21:54:56,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 21:54:56,673 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:54:56,673 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:54:56,673 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:54:56,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:54:56,673 INFO L82 PathProgramCache]: Analyzing trace with hash 952302064, now seen corresponding path program 1 times [2019-12-27 21:54:56,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:54:56,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105383293] [2019-12-27 21:54:56,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:54:56,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:54:56,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:54:56,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105383293] [2019-12-27 21:54:56,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:54:56,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:54:56,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1799505756] [2019-12-27 21:54:56,777 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:54:56,780 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:54:56,783 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 21:54:56,783 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:54:56,803 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:54:56,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:54:56,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:54:56,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:54:56,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:54:56,804 INFO L87 Difference]: Start difference. First operand 12030 states and 39340 transitions. Second operand 5 states. [2019-12-27 21:54:57,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:54:57,032 INFO L93 Difference]: Finished difference Result 14351 states and 46280 transitions. [2019-12-27 21:54:57,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:54:57,032 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 21:54:57,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:54:57,072 INFO L225 Difference]: With dead ends: 14351 [2019-12-27 21:54:57,072 INFO L226 Difference]: Without dead ends: 14338 [2019-12-27 21:54:57,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:54:57,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14338 states. [2019-12-27 21:54:57,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14338 to 12371. [2019-12-27 21:54:57,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12371 states. [2019-12-27 21:54:57,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12371 states to 12371 states and 40477 transitions. [2019-12-27 21:54:57,425 INFO L78 Accepts]: Start accepts. Automaton has 12371 states and 40477 transitions. Word has length 14 [2019-12-27 21:54:57,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:54:57,425 INFO L462 AbstractCegarLoop]: Abstraction has 12371 states and 40477 transitions. [2019-12-27 21:54:57,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:54:57,425 INFO L276 IsEmpty]: Start isEmpty. Operand 12371 states and 40477 transitions. [2019-12-27 21:54:57,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:54:57,430 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:54:57,431 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:54:57,431 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:54:57,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:54:57,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1929456170, now seen corresponding path program 1 times [2019-12-27 21:54:57,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:54:57,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376979427] [2019-12-27 21:54:57,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:54:57,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:54:57,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:54:57,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376979427] [2019-12-27 21:54:57,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:54:57,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:54:57,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1723209215] [2019-12-27 21:54:57,496 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:54:57,499 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:54:57,501 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 18 states and 18 transitions. [2019-12-27 21:54:57,501 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:54:57,501 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:54:57,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:54:57,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:54:57,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:54:57,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:54:57,503 INFO L87 Difference]: Start difference. First operand 12371 states and 40477 transitions. Second operand 3 states. [2019-12-27 21:54:57,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:54:57,657 INFO L93 Difference]: Finished difference Result 12224 states and 39993 transitions. [2019-12-27 21:54:57,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:54:57,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 21:54:57,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:54:57,692 INFO L225 Difference]: With dead ends: 12224 [2019-12-27 21:54:57,692 INFO L226 Difference]: Without dead ends: 12224 [2019-12-27 21:54:57,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:54:57,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12224 states. [2019-12-27 21:54:57,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12224 to 12224. [2019-12-27 21:54:57,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12224 states. [2019-12-27 21:54:58,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12224 states to 12224 states and 39993 transitions. [2019-12-27 21:54:58,043 INFO L78 Accepts]: Start accepts. Automaton has 12224 states and 39993 transitions. Word has length 16 [2019-12-27 21:54:58,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:54:58,044 INFO L462 AbstractCegarLoop]: Abstraction has 12224 states and 39993 transitions. [2019-12-27 21:54:58,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:54:58,044 INFO L276 IsEmpty]: Start isEmpty. Operand 12224 states and 39993 transitions. [2019-12-27 21:54:58,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 21:54:58,054 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:54:58,055 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:54:58,055 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:54:58,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:54:58,055 INFO L82 PathProgramCache]: Analyzing trace with hash 324203655, now seen corresponding path program 1 times [2019-12-27 21:54:58,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:54:58,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935577761] [2019-12-27 21:54:58,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:54:58,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:54:58,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:54:58,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935577761] [2019-12-27 21:54:58,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:54:58,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:54:58,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1310376498] [2019-12-27 21:54:58,159 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:54:58,164 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:54:58,168 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 21 states and 23 transitions. [2019-12-27 21:54:58,169 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:54:58,169 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:54:58,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:54:58,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:54:58,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:54:58,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:54:58,170 INFO L87 Difference]: Start difference. First operand 12224 states and 39993 transitions. Second operand 3 states. [2019-12-27 21:54:58,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:54:58,230 INFO L93 Difference]: Finished difference Result 11575 states and 37288 transitions. [2019-12-27 21:54:58,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:54:58,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-27 21:54:58,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:54:58,257 INFO L225 Difference]: With dead ends: 11575 [2019-12-27 21:54:58,257 INFO L226 Difference]: Without dead ends: 11575 [2019-12-27 21:54:58,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:54:58,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11575 states. [2019-12-27 21:54:58,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11575 to 11443. [2019-12-27 21:54:58,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11443 states. [2019-12-27 21:54:58,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11443 states to 11443 states and 36904 transitions. [2019-12-27 21:54:58,647 INFO L78 Accepts]: Start accepts. Automaton has 11443 states and 36904 transitions. Word has length 17 [2019-12-27 21:54:58,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:54:58,647 INFO L462 AbstractCegarLoop]: Abstraction has 11443 states and 36904 transitions. [2019-12-27 21:54:58,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:54:58,647 INFO L276 IsEmpty]: Start isEmpty. Operand 11443 states and 36904 transitions. [2019-12-27 21:54:58,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 21:54:58,655 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:54:58,655 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:54:58,655 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:54:58,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:54:58,656 INFO L82 PathProgramCache]: Analyzing trace with hash -2136099962, now seen corresponding path program 1 times [2019-12-27 21:54:58,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:54:58,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391562240] [2019-12-27 21:54:58,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:54:58,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:54:58,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-27 21:54:58,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391562240] [2019-12-27 21:54:58,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:54:58,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:54:58,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1785785200] [2019-12-27 21:54:58,722 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:54:58,725 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:54:58,727 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 24 transitions. [2019-12-27 21:54:58,728 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:54:58,730 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:54:58,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:54:58,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:54:58,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:54:58,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:54:58,731 INFO L87 Difference]: Start difference. First operand 11443 states and 36904 transitions. Second operand 4 states. [2019-12-27 21:54:58,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:54:58,766 INFO L93 Difference]: Finished difference Result 2348 states and 6213 transitions. [2019-12-27 21:54:58,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:54:58,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-27 21:54:58,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:54:58,770 INFO L225 Difference]: With dead ends: 2348 [2019-12-27 21:54:58,770 INFO L226 Difference]: Without dead ends: 1670 [2019-12-27 21:54:58,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:54:58,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2019-12-27 21:54:58,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 1670. [2019-12-27 21:54:58,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1670 states. [2019-12-27 21:54:58,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 4015 transitions. [2019-12-27 21:54:58,796 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 4015 transitions. Word has length 18 [2019-12-27 21:54:58,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:54:58,796 INFO L462 AbstractCegarLoop]: Abstraction has 1670 states and 4015 transitions. [2019-12-27 21:54:58,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:54:58,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 4015 transitions. [2019-12-27 21:54:58,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 21:54:58,799 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:54:58,800 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] [2019-12-27 21:54:58,800 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:54:58,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:54:58,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1556475985, now seen corresponding path program 1 times [2019-12-27 21:54:58,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:54:58,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957665066] [2019-12-27 21:54:58,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:54:58,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:54:58,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:54:58,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957665066] [2019-12-27 21:54:58,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:54:58,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:54:58,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [64404304] [2019-12-27 21:54:58,843 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:54:58,848 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:54:58,859 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 86 transitions. [2019-12-27 21:54:58,859 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:54:58,881 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:54:58,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:54:58,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:54:58,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:54:58,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:54:58,883 INFO L87 Difference]: Start difference. First operand 1670 states and 4015 transitions. Second operand 5 states. [2019-12-27 21:54:58,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:54:58,943 INFO L93 Difference]: Finished difference Result 2134 states and 4852 transitions. [2019-12-27 21:54:58,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:54:58,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 21:54:58,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:54:58,946 INFO L225 Difference]: With dead ends: 2134 [2019-12-27 21:54:58,946 INFO L226 Difference]: Without dead ends: 2134 [2019-12-27 21:54:58,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:54:58,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2134 states. [2019-12-27 21:54:58,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2134 to 1555. [2019-12-27 21:54:58,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2019-12-27 21:54:58,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 3503 transitions. [2019-12-27 21:54:58,973 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 3503 transitions. Word has length 26 [2019-12-27 21:54:58,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:54:58,973 INFO L462 AbstractCegarLoop]: Abstraction has 1555 states and 3503 transitions. [2019-12-27 21:54:58,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:54:58,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 3503 transitions. [2019-12-27 21:54:58,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 21:54:58,976 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:54:58,976 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] [2019-12-27 21:54:58,976 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:54:58,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:54:58,977 INFO L82 PathProgramCache]: Analyzing trace with hash 118725068, now seen corresponding path program 1 times [2019-12-27 21:54:58,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:54:58,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251589340] [2019-12-27 21:54:58,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:54:58,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:54:59,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:54:59,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251589340] [2019-12-27 21:54:59,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:54:59,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:54:59,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1564963115] [2019-12-27 21:54:59,059 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:54:59,064 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:54:59,077 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 86 transitions. [2019-12-27 21:54:59,077 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:54:59,094 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:54:59,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:54:59,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:54:59,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:54:59,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:54:59,096 INFO L87 Difference]: Start difference. First operand 1555 states and 3503 transitions. Second operand 6 states. [2019-12-27 21:54:59,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:54:59,318 INFO L93 Difference]: Finished difference Result 2150 states and 4849 transitions. [2019-12-27 21:54:59,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:54:59,318 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-27 21:54:59,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:54:59,321 INFO L225 Difference]: With dead ends: 2150 [2019-12-27 21:54:59,321 INFO L226 Difference]: Without dead ends: 2148 [2019-12-27 21:54:59,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:54:59,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2148 states. [2019-12-27 21:54:59,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2148 to 1647. [2019-12-27 21:54:59,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1647 states. [2019-12-27 21:54:59,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 3725 transitions. [2019-12-27 21:54:59,350 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 3725 transitions. Word has length 26 [2019-12-27 21:54:59,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:54:59,350 INFO L462 AbstractCegarLoop]: Abstraction has 1647 states and 3725 transitions. [2019-12-27 21:54:59,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:54:59,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 3725 transitions. [2019-12-27 21:54:59,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 21:54:59,353 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:54:59,353 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] [2019-12-27 21:54:59,353 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:54:59,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:54:59,353 INFO L82 PathProgramCache]: Analyzing trace with hash -945954291, now seen corresponding path program 1 times [2019-12-27 21:54:59,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:54:59,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219051575] [2019-12-27 21:54:59,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:54:59,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:54:59,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:54:59,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219051575] [2019-12-27 21:54:59,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:54:59,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:54:59,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1444999664] [2019-12-27 21:54:59,416 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:54:59,421 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:54:59,438 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 60 states and 91 transitions. [2019-12-27 21:54:59,438 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:54:59,459 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:54:59,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:54:59,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:54:59,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:54:59,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:54:59,461 INFO L87 Difference]: Start difference. First operand 1647 states and 3725 transitions. Second operand 6 states. [2019-12-27 21:54:59,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:54:59,690 INFO L93 Difference]: Finished difference Result 2085 states and 4728 transitions. [2019-12-27 21:54:59,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:54:59,691 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 21:54:59,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:54:59,693 INFO L225 Difference]: With dead ends: 2085 [2019-12-27 21:54:59,694 INFO L226 Difference]: Without dead ends: 2083 [2019-12-27 21:54:59,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:54:59,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2083 states. [2019-12-27 21:54:59,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2083 to 1574. [2019-12-27 21:54:59,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2019-12-27 21:54:59,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 3550 transitions. [2019-12-27 21:54:59,719 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 3550 transitions. Word has length 27 [2019-12-27 21:54:59,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:54:59,719 INFO L462 AbstractCegarLoop]: Abstraction has 1574 states and 3550 transitions. [2019-12-27 21:54:59,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:54:59,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 3550 transitions. [2019-12-27 21:54:59,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 21:54:59,722 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:54:59,722 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] [2019-12-27 21:54:59,722 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:54:59,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:54:59,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1929035231, now seen corresponding path program 1 times [2019-12-27 21:54:59,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:54:59,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287539454] [2019-12-27 21:54:59,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:54:59,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:54:59,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:54:59,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287539454] [2019-12-27 21:54:59,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:54:59,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:54:59,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1789576593] [2019-12-27 21:54:59,803 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:54:59,807 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:54:59,813 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 21:54:59,813 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:54:59,813 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:54:59,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:54:59,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:54:59,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:54:59,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:54:59,815 INFO L87 Difference]: Start difference. First operand 1574 states and 3550 transitions. Second operand 5 states. [2019-12-27 21:54:59,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:54:59,861 INFO L93 Difference]: Finished difference Result 781 states and 1674 transitions. [2019-12-27 21:54:59,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:54:59,862 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 21:54:59,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:54:59,863 INFO L225 Difference]: With dead ends: 781 [2019-12-27 21:54:59,863 INFO L226 Difference]: Without dead ends: 707 [2019-12-27 21:54:59,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:54:59,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2019-12-27 21:54:59,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 707. [2019-12-27 21:54:59,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707 states. [2019-12-27 21:54:59,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1503 transitions. [2019-12-27 21:54:59,876 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1503 transitions. Word has length 27 [2019-12-27 21:54:59,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:54:59,876 INFO L462 AbstractCegarLoop]: Abstraction has 707 states and 1503 transitions. [2019-12-27 21:54:59,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:54:59,876 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1503 transitions. [2019-12-27 21:54:59,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 21:54:59,879 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:54:59,879 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] [2019-12-27 21:54:59,879 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:54:59,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:54:59,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1133197983, now seen corresponding path program 1 times [2019-12-27 21:54:59,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:54:59,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753950832] [2019-12-27 21:54:59,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:54:59,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:55:00,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:55:00,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753950832] [2019-12-27 21:55:00,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:55:00,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:55:00,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1083780014] [2019-12-27 21:55:00,006 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:55:00,016 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:55:00,057 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 91 states and 132 transitions. [2019-12-27 21:55:00,057 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:55:00,058 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:55:00,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:55:00,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:55:00,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:55:00,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:55:00,059 INFO L87 Difference]: Start difference. First operand 707 states and 1503 transitions. Second operand 4 states. [2019-12-27 21:55:00,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:55:00,080 INFO L93 Difference]: Finished difference Result 1173 states and 2520 transitions. [2019-12-27 21:55:00,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:55:00,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-27 21:55:00,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:55:00,083 INFO L225 Difference]: With dead ends: 1173 [2019-12-27 21:55:00,084 INFO L226 Difference]: Without dead ends: 486 [2019-12-27 21:55:00,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:55:00,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2019-12-27 21:55:00,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 486. [2019-12-27 21:55:00,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2019-12-27 21:55:00,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 1050 transitions. [2019-12-27 21:55:00,094 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 1050 transitions. Word has length 42 [2019-12-27 21:55:00,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:55:00,094 INFO L462 AbstractCegarLoop]: Abstraction has 486 states and 1050 transitions. [2019-12-27 21:55:00,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:55:00,094 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 1050 transitions. [2019-12-27 21:55:00,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 21:55:00,096 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:55:00,096 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] [2019-12-27 21:55:00,097 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:55:00,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:55:00,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1118913551, now seen corresponding path program 2 times [2019-12-27 21:55:00,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:55:00,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355763995] [2019-12-27 21:55:00,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:55:00,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:55:00,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:55:00,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355763995] [2019-12-27 21:55:00,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:55:00,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:55:00,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [486290603] [2019-12-27 21:55:00,215 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:55:00,223 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:55:00,252 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 69 states and 94 transitions. [2019-12-27 21:55:00,252 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:55:00,275 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:55:00,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:55:00,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:55:00,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:55:00,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:55:00,277 INFO L87 Difference]: Start difference. First operand 486 states and 1050 transitions. Second operand 7 states. [2019-12-27 21:55:00,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:55:00,434 INFO L93 Difference]: Finished difference Result 887 states and 1866 transitions. [2019-12-27 21:55:00,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 21:55:00,435 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-12-27 21:55:00,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:55:00,436 INFO L225 Difference]: With dead ends: 887 [2019-12-27 21:55:00,436 INFO L226 Difference]: Without dead ends: 593 [2019-12-27 21:55:00,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:55:00,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2019-12-27 21:55:00,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 527. [2019-12-27 21:55:00,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2019-12-27 21:55:00,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 1106 transitions. [2019-12-27 21:55:00,443 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 1106 transitions. Word has length 42 [2019-12-27 21:55:00,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:55:00,443 INFO L462 AbstractCegarLoop]: Abstraction has 527 states and 1106 transitions. [2019-12-27 21:55:00,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:55:00,443 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 1106 transitions. [2019-12-27 21:55:00,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 21:55:00,445 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:55:00,445 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] [2019-12-27 21:55:00,445 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:55:00,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:55:00,445 INFO L82 PathProgramCache]: Analyzing trace with hash -866328177, now seen corresponding path program 3 times [2019-12-27 21:55:00,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:55:00,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616073701] [2019-12-27 21:55:00,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:55:00,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:55:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:55:00,549 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:55:00,549 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:55:00,553 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_40| 0 0))) (and (= 0 v_~y$w_buff0~0_26) (= 0 v_~y$read_delayed_var~0.base_6) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~__unbuffered_p1_EAX~0_13) (= 0 v_~__unbuffered_p0_EAX~0_13) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~y$r_buff1_thd1~0_37) (= 0 v_~y$r_buff1_thd0~0_20) (= 0 v_~__unbuffered_cnt~0_15) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1653~0.base_19| 4)) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff0_thd2~0_26 0) (= 0 v_~y$w_buff0_used~0_93) (= v_~y$w_buff1_used~0_54 0) (= v_~x~0_10 0) (= 0 v_~y$w_buff1~0_21) (= v_~y$r_buff0_thd0~0_22 0) (= 0 v_~y$flush_delayed~0_13) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= v_~y~0_22 0) (= 0 v_~weak$$choice0~0_7) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1653~0.base_19|) (= v_~y$r_buff0_thd1~0_65 0) (= 0 v_~y$r_buff1_thd2~0_17) (= (store .cse0 |v_ULTIMATE.start_main_~#t1653~0.base_19| 1) |v_#valid_38|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1653~0.base_19|) 0) (= 0 v_~z~0_8) (= v_~y$mem_tmp~0_10 0) (= v_~__unbuffered_p1_EBX~0_13 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1653~0.base_19| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1653~0.base_19|) |v_ULTIMATE.start_main_~#t1653~0.offset_17| 0)) |v_#memory_int_11|) (= v_~main$tmp_guard1~0_12 0) (= 0 |v_ULTIMATE.start_main_~#t1653~0.offset_17|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_93, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_7|, ULTIMATE.start_main_~#t1654~0.offset=|v_ULTIMATE.start_main_~#t1654~0.offset_17|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_37, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_13, ~y$w_buff0~0=v_~y$w_buff0~0_26, ULTIMATE.start_main_~#t1653~0.offset=|v_ULTIMATE.start_main_~#t1653~0.offset_17|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_65, ~y$flush_delayed~0=v_~y$flush_delayed~0_13, #length=|v_#length_13|, ULTIMATE.start_main_~#t1654~0.base=|v_ULTIMATE.start_main_~#t1654~0.base_22|, ~y~0=v_~y~0_22, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_18|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_10|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_10|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_17, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ~y$w_buff1~0=v_~y$w_buff1~0_21, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_22, #valid=|v_#valid_38|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_26, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1653~0.base=|v_ULTIMATE.start_main_~#t1653~0.base_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~z~0=v_~z~0_8, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_20, ~x~0=v_~x~0_10, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_54} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1654~0.offset, #NULL.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ULTIMATE.start_main_~#t1653~0.offset, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t1654~0.base, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_~#t1653~0.base, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 21:55:00,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L802-1-->L804: Formula: (and (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1654~0.base_9| 4) |v_#length_9|) (= 0 (select |v_#valid_20| |v_ULTIMATE.start_main_~#t1654~0.base_9|)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1654~0.base_9|) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1654~0.base_9| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1654~0.base_9|) |v_ULTIMATE.start_main_~#t1654~0.offset_8| 1))) (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t1654~0.base_9| 1)) (= |v_ULTIMATE.start_main_~#t1654~0.offset_8| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1654~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, ULTIMATE.start_main_~#t1654~0.offset=|v_ULTIMATE.start_main_~#t1654~0.offset_8|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1654~0.base=|v_ULTIMATE.start_main_~#t1654~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1654~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1654~0.base] because there is no mapped edge [2019-12-27 21:55:00,555 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L5-->L779: Formula: (and (= v_~y$r_buff0_thd1~0_53 v_~y$r_buff1_thd1~0_28) (= v_~y$r_buff0_thd2~0_21 v_~y$r_buff1_thd2~0_11) (= v_~__unbuffered_p1_EBX~0_5 v_~x~0_5) (= v_~y$r_buff0_thd0~0_17 v_~y$r_buff1_thd0~0_11) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8)) (= v_~__unbuffered_p1_EAX~0_5 v_~z~0_4) (= 1 v_~z~0_4) (= v_~y$r_buff0_thd2~0_20 1)) InVars {P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_17, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_53, ~x~0=v_~x~0_5} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_11, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_28, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_5, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_5, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_17, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_20, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_53, ~z~0=v_~z~0_4, ~x~0=v_~x~0_5, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_11} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 21:55:00,558 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L780-->L780-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1580697999 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1580697999 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out1580697999| ~y$w_buff0_used~0_In1580697999)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out1580697999| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1580697999, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1580697999} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1580697999, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1580697999, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1580697999|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 21:55:00,559 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L781-->L781-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1281450581 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-1281450581 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In-1281450581 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-1281450581 256) 0))) (or (and (= ~y$w_buff1_used~0_In-1281450581 |P1Thread1of1ForFork0_#t~ite29_Out-1281450581|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork0_#t~ite29_Out-1281450581| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1281450581, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1281450581, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1281450581, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1281450581} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1281450581, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1281450581, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1281450581, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1281450581|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1281450581} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 21:55:00,559 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L782-->L783: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-381981485 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-381981485 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In-381981485 ~y$r_buff0_thd2~0_Out-381981485)) (and (not .cse1) (= ~y$r_buff0_thd2~0_Out-381981485 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-381981485, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-381981485} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-381981485, P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-381981485|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-381981485} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 21:55:00,563 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L742-->L742-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-656311733 256) 0))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-656311733 256)))) (or (= (mod ~y$w_buff0_used~0_In-656311733 256) 0) (and .cse1 (= (mod ~y$w_buff1_used~0_In-656311733 256) 0)) (and (= (mod ~y$r_buff1_thd1~0_In-656311733 256) 0) .cse1))) (= |P0Thread1of1ForFork1_#t~ite17_Out-656311733| |P0Thread1of1ForFork1_#t~ite18_Out-656311733|) (= ~y$w_buff1_used~0_In-656311733 |P0Thread1of1ForFork1_#t~ite17_Out-656311733|)) (and (not .cse0) (= ~y$w_buff1_used~0_In-656311733 |P0Thread1of1ForFork1_#t~ite18_Out-656311733|) (= |P0Thread1of1ForFork1_#t~ite17_In-656311733| |P0Thread1of1ForFork1_#t~ite17_Out-656311733|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-656311733, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-656311733, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-656311733, P0Thread1of1ForFork1_#t~ite17=|P0Thread1of1ForFork1_#t~ite17_In-656311733|, ~weak$$choice2~0=~weak$$choice2~0_In-656311733, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-656311733} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-656311733, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-656311733, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-656311733, P0Thread1of1ForFork1_#t~ite18=|P0Thread1of1ForFork1_#t~ite18_Out-656311733|, P0Thread1of1ForFork1_#t~ite17=|P0Thread1of1ForFork1_#t~ite17_Out-656311733|, ~weak$$choice2~0=~weak$$choice2~0_In-656311733, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-656311733} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite18, P0Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-27 21:55:00,564 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L743-->L744: Formula: (and (= v_~y$r_buff0_thd1~0_47 v_~y$r_buff0_thd1~0_46) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_47, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_7|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_10|, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_9|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_46, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, P0Thread1of1ForFork1_#t~ite19, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 21:55:00,565 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [599] [599] L746-->L754: Formula: (and (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~y~0_16 v_~y$mem_tmp~0_4) (= v_~__unbuffered_cnt~0_8 (+ v_~__unbuffered_cnt~0_9 1))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, ~y~0=v_~y~0_16} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-27 21:55:00,565 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L783-->L783-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1458024550 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1458024550 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In1458024550 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In1458024550 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite31_Out1458024550| ~y$r_buff1_thd2~0_In1458024550) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork0_#t~ite31_Out1458024550| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1458024550, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1458024550, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1458024550, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1458024550} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1458024550, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1458024550, P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1458024550|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1458024550, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1458024550} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 21:55:00,566 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L783-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork0_#t~ite31_8|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_13, P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 21:55:00,566 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [581] [581] L808-->L810-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_5 256))) (or (= 0 (mod v_~y$w_buff0_used~0_62 256)) (= (mod v_~y$r_buff0_thd0~0_15 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_62, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_62, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 21:55:00,566 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L810-2-->L810-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In1598143410 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1598143410 256)))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In1598143410 |ULTIMATE.start_main_#t~ite34_Out1598143410|)) (and (= ~y~0_In1598143410 |ULTIMATE.start_main_#t~ite34_Out1598143410|) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1598143410, ~y~0=~y~0_In1598143410, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1598143410, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1598143410} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1598143410, ~y~0=~y~0_In1598143410, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1598143410, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out1598143410|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1598143410} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 21:55:00,567 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [569] [569] L810-4-->L811: Formula: (= v_~y~0_13 |v_ULTIMATE.start_main_#t~ite34_7|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_7|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_6|, ~y~0=v_~y~0_13, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~y~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 21:55:00,567 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-117419806 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-117419806 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-117419806 |ULTIMATE.start_main_#t~ite36_Out-117419806|)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite36_Out-117419806|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-117419806, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-117419806} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-117419806, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-117419806, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-117419806|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 21:55:00,567 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L812-->L812-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1074293096 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-1074293096 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1074293096 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-1074293096 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-1074293096 |ULTIMATE.start_main_#t~ite37_Out-1074293096|)) (and (= 0 |ULTIMATE.start_main_#t~ite37_Out-1074293096|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1074293096, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1074293096, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1074293096, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1074293096} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1074293096, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1074293096, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1074293096|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1074293096, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1074293096} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 21:55:00,568 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1210073737 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1210073737 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out-1210073737| ~y$r_buff0_thd0~0_In-1210073737) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite38_Out-1210073737|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1210073737, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1210073737} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1210073737, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1210073737, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1210073737|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 21:55:00,569 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L814-->L814-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1208314935 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1208314935 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1208314935 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In1208314935 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite39_Out1208314935| 0)) (and (= |ULTIMATE.start_main_#t~ite39_Out1208314935| ~y$r_buff1_thd0~0_In1208314935) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1208314935, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1208314935, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1208314935, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1208314935} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1208314935, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1208314935|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1208314935, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1208314935, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1208314935} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 21:55:00,569 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~__unbuffered_p0_EAX~0_9 0) (= v_~main$tmp_guard1~0_8 0) (= |v_ULTIMATE.start_main_#t~ite39_12| v_~y$r_buff1_thd0~0_15) (= 1 v_~__unbuffered_p1_EAX~0_9) (= 0 v_~__unbuffered_p1_EBX~0_9)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_12|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_15, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 21:55:00,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:55:00 BasicIcfg [2019-12-27 21:55:00,629 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:55:00,631 INFO L168 Benchmark]: Toolchain (without parser) took 14293.90 ms. Allocated memory was 136.3 MB in the beginning and 719.8 MB in the end (delta: 583.5 MB). Free memory was 98.3 MB in the beginning and 394.7 MB in the end (delta: -296.4 MB). Peak memory consumption was 287.2 MB. Max. memory is 7.1 GB. [2019-12-27 21:55:00,632 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 136.3 MB. Free memory was 118.2 MB in the beginning and 118.0 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 21:55:00,633 INFO L168 Benchmark]: CACSL2BoogieTranslator took 792.06 ms. Allocated memory was 136.3 MB in the beginning and 200.3 MB in the end (delta: 64.0 MB). Free memory was 97.9 MB in the beginning and 155.0 MB in the end (delta: -57.1 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2019-12-27 21:55:00,639 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.11 ms. Allocated memory is still 200.3 MB. Free memory was 155.0 MB in the beginning and 152.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 21:55:00,642 INFO L168 Benchmark]: Boogie Preprocessor took 37.98 ms. Allocated memory is still 200.3 MB. Free memory was 152.2 MB in the beginning and 150.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 21:55:00,644 INFO L168 Benchmark]: RCFGBuilder took 742.04 ms. Allocated memory is still 200.3 MB. Free memory was 150.2 MB in the beginning and 109.3 MB in the end (delta: 40.9 MB). Peak memory consumption was 40.9 MB. Max. memory is 7.1 GB. [2019-12-27 21:55:00,645 INFO L168 Benchmark]: TraceAbstraction took 12656.35 ms. Allocated memory was 200.3 MB in the beginning and 719.8 MB in the end (delta: 519.6 MB). Free memory was 108.6 MB in the beginning and 394.7 MB in the end (delta: -286.1 MB). Peak memory consumption was 233.4 MB. Max. memory is 7.1 GB. [2019-12-27 21:55:00,651 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.27 ms. Allocated memory is still 136.3 MB. Free memory was 118.2 MB in the beginning and 118.0 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 792.06 ms. Allocated memory was 136.3 MB in the beginning and 200.3 MB in the end (delta: 64.0 MB). Free memory was 97.9 MB in the beginning and 155.0 MB in the end (delta: -57.1 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 57.11 ms. Allocated memory is still 200.3 MB. Free memory was 155.0 MB in the beginning and 152.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.98 ms. Allocated memory is still 200.3 MB. Free memory was 152.2 MB in the beginning and 150.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 742.04 ms. Allocated memory is still 200.3 MB. Free memory was 150.2 MB in the beginning and 109.3 MB in the end (delta: 40.9 MB). Peak memory consumption was 40.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12656.35 ms. Allocated memory was 200.3 MB in the beginning and 719.8 MB in the end (delta: 519.6 MB). Free memory was 108.6 MB in the beginning and 394.7 MB in the end (delta: -286.1 MB). Peak memory consumption was 233.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.2s, 137 ProgramPointsBefore, 69 ProgramPointsAfterwards, 165 TransitionsBefore, 81 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 19 ChoiceCompositions, 4208 VarBasedMoverChecksPositive, 150 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 41237 CheckedPairsTotal, 97 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L802] FCALL, FORK 0 pthread_create(&t1653, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] FCALL, FORK 0 pthread_create(&t1654, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L759] 2 y$w_buff1 = y$w_buff0 [L760] 2 y$w_buff0 = 1 [L761] 2 y$w_buff1_used = y$w_buff0_used [L762] 2 y$w_buff0_used = (_Bool)1 [L779] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 1 x = 1 [L734] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L735] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L736] 1 y$flush_delayed = weak$$choice2 [L737] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L738] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L779] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L780] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L781] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L738] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L739] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L741] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L741] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L742] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L806] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 131 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.3s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1455 SDtfs, 1467 SDslu, 2431 SDs, 0 SdLazy, 964 SolverSat, 78 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12371occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 6871 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 341 NumberOfCodeBlocks, 341 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 285 ConstructedInterpolants, 0 QuantifiedInterpolants, 20852 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...