/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe013_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 14:38:55,159 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 14:38:55,162 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 14:38:55,177 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 14:38:55,178 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 14:38:55,179 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 14:38:55,180 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 14:38:55,182 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 14:38:55,184 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 14:38:55,185 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 14:38:55,186 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 14:38:55,187 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 14:38:55,188 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 14:38:55,189 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 14:38:55,190 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 14:38:55,191 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 14:38:55,192 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 14:38:55,193 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 14:38:55,195 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 14:38:55,196 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 14:38:55,198 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 14:38:55,199 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 14:38:55,200 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 14:38:55,201 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 14:38:55,203 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 14:38:55,203 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 14:38:55,203 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 14:38:55,204 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 14:38:55,205 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 14:38:55,206 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 14:38:55,206 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 14:38:55,207 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 14:38:55,208 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 14:38:55,208 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 14:38:55,209 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 14:38:55,210 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 14:38:55,210 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 14:38:55,210 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 14:38:55,211 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 14:38:55,212 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 14:38:55,212 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 14:38:55,213 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 14:38:55,230 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 14:38:55,230 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 14:38:55,231 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 14:38:55,231 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 14:38:55,232 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 14:38:55,232 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 14:38:55,232 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 14:38:55,232 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 14:38:55,233 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 14:38:55,233 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 14:38:55,233 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 14:38:55,233 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 14:38:55,233 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 14:38:55,234 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 14:38:55,234 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 14:38:55,234 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 14:38:55,234 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 14:38:55,234 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 14:38:55,235 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 14:38:55,235 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 14:38:55,235 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 14:38:55,235 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:38:55,235 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 14:38:55,236 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 14:38:55,236 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 14:38:55,236 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 14:38:55,236 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 14:38:55,237 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 14:38:55,237 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 14:38:55,237 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 14:38:55,540 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 14:38:55,559 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 14:38:55,562 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 14:38:55,564 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 14:38:55,565 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 14:38:55,566 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe013_power.opt.i [2019-12-18 14:38:55,651 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e3fcac2a/5284eaf949104b08bfdcb420c3981ddd/FLAGb7950f46f [2019-12-18 14:38:56,294 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 14:38:56,295 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe013_power.opt.i [2019-12-18 14:38:56,312 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e3fcac2a/5284eaf949104b08bfdcb420c3981ddd/FLAGb7950f46f [2019-12-18 14:38:56,539 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e3fcac2a/5284eaf949104b08bfdcb420c3981ddd [2019-12-18 14:38:56,549 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 14:38:56,550 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 14:38:56,551 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 14:38:56,552 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 14:38:56,556 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 14:38:56,557 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:38:56" (1/1) ... [2019-12-18 14:38:56,560 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31b75db2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:38:56, skipping insertion in model container [2019-12-18 14:38:56,560 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:38:56" (1/1) ... [2019-12-18 14:38:56,567 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 14:38:56,622 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 14:38:57,110 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:38:57,130 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 14:38:57,242 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:38:57,327 INFO L208 MainTranslator]: Completed translation [2019-12-18 14:38:57,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:38:57 WrapperNode [2019-12-18 14:38:57,328 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 14:38:57,329 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 14:38:57,329 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 14:38:57,329 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 14:38:57,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:38:57" (1/1) ... [2019-12-18 14:38:57,364 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:38:57" (1/1) ... [2019-12-18 14:38:57,399 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 14:38:57,399 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 14:38:57,399 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 14:38:57,399 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 14:38:57,409 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:38:57" (1/1) ... [2019-12-18 14:38:57,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:38:57" (1/1) ... [2019-12-18 14:38:57,413 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:38:57" (1/1) ... [2019-12-18 14:38:57,414 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:38:57" (1/1) ... [2019-12-18 14:38:57,424 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:38:57" (1/1) ... [2019-12-18 14:38:57,428 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:38:57" (1/1) ... [2019-12-18 14:38:57,431 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:38:57" (1/1) ... [2019-12-18 14:38:57,436 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 14:38:57,437 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 14:38:57,437 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 14:38:57,437 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 14:38:57,438 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:38:57" (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-18 14:38:57,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 14:38:57,523 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 14:38:57,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 14:38:57,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 14:38:57,523 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 14:38:57,524 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 14:38:57,524 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 14:38:57,524 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 14:38:57,524 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 14:38:57,525 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 14:38:57,525 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 14:38:57,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 14:38:57,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 14:38:57,527 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 14:38:58,262 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 14:38:58,263 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 14:38:58,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:38:58 BoogieIcfgContainer [2019-12-18 14:38:58,264 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 14:38:58,266 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 14:38:58,266 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 14:38:58,269 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 14:38:58,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 02:38:56" (1/3) ... [2019-12-18 14:38:58,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7970096f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:38:58, skipping insertion in model container [2019-12-18 14:38:58,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:38:57" (2/3) ... [2019-12-18 14:38:58,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7970096f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:38:58, skipping insertion in model container [2019-12-18 14:38:58,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:38:58" (3/3) ... [2019-12-18 14:38:58,273 INFO L109 eAbstractionObserver]: Analyzing ICFG safe013_power.opt.i [2019-12-18 14:38:58,283 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 14:38:58,284 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 14:38:58,293 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 14:38:58,294 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 14:38:58,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,346 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,346 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,383 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,384 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,384 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,385 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,387 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,435 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,436 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,445 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,445 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,445 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,454 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,454 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,459 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,460 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:38:58,479 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 14:38:58,501 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 14:38:58,501 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 14:38:58,501 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 14:38:58,501 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 14:38:58,502 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 14:38:58,502 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 14:38:58,502 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 14:38:58,502 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 14:38:58,525 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-18 14:38:58,526 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-18 14:38:58,617 INFO L126 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-18 14:38:58,617 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:38:58,635 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 14:38:58,666 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-18 14:38:58,715 INFO L126 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-18 14:38:58,716 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:38:58,731 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 14:38:58,759 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 14:38:58,760 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 14:39:04,366 WARN L192 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 14:39:04,483 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 14:39:04,622 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66094 [2019-12-18 14:39:04,622 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-18 14:39:04,626 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 92 transitions [2019-12-18 14:39:15,930 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 86132 states. [2019-12-18 14:39:15,932 INFO L276 IsEmpty]: Start isEmpty. Operand 86132 states. [2019-12-18 14:39:15,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 14:39:15,938 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:39:15,939 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 14:39:15,939 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:39:15,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:39:15,944 INFO L82 PathProgramCache]: Analyzing trace with hash 794637732, now seen corresponding path program 1 times [2019-12-18 14:39:15,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:39:15,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561756169] [2019-12-18 14:39:15,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:39:16,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:39:16,159 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-18 14:39:16,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561756169] [2019-12-18 14:39:16,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:39:16,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:39:16,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611191244] [2019-12-18 14:39:16,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:39:16,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:39:16,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:39:16,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:39:16,185 INFO L87 Difference]: Start difference. First operand 86132 states. Second operand 3 states. [2019-12-18 14:39:18,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:39:18,704 INFO L93 Difference]: Finished difference Result 85012 states and 367904 transitions. [2019-12-18 14:39:18,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:39:18,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 14:39:18,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:39:19,242 INFO L225 Difference]: With dead ends: 85012 [2019-12-18 14:39:19,243 INFO L226 Difference]: Without dead ends: 80140 [2019-12-18 14:39:19,244 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-18 14:39:22,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80140 states. [2019-12-18 14:39:25,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80140 to 80140. [2019-12-18 14:39:25,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80140 states. [2019-12-18 14:39:29,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80140 states to 80140 states and 346330 transitions. [2019-12-18 14:39:29,525 INFO L78 Accepts]: Start accepts. Automaton has 80140 states and 346330 transitions. Word has length 5 [2019-12-18 14:39:29,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:39:29,526 INFO L462 AbstractCegarLoop]: Abstraction has 80140 states and 346330 transitions. [2019-12-18 14:39:29,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:39:29,526 INFO L276 IsEmpty]: Start isEmpty. Operand 80140 states and 346330 transitions. [2019-12-18 14:39:29,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 14:39:29,539 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:39:29,539 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:39:29,539 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:39:29,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:39:29,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1795694344, now seen corresponding path program 1 times [2019-12-18 14:39:29,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:39:29,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704634243] [2019-12-18 14:39:29,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:39:29,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:39:29,662 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-18 14:39:29,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704634243] [2019-12-18 14:39:29,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:39:29,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:39:29,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552040796] [2019-12-18 14:39:29,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:39:29,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:39:29,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:39:29,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:39:29,666 INFO L87 Difference]: Start difference. First operand 80140 states and 346330 transitions. Second operand 4 states. [2019-12-18 14:39:30,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:39:30,594 INFO L93 Difference]: Finished difference Result 123388 states and 510822 transitions. [2019-12-18 14:39:30,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:39:30,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 14:39:30,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:39:31,210 INFO L225 Difference]: With dead ends: 123388 [2019-12-18 14:39:31,210 INFO L226 Difference]: Without dead ends: 123290 [2019-12-18 14:39:31,211 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-18 14:39:38,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123290 states. [2019-12-18 14:39:40,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123290 to 114218. [2019-12-18 14:39:40,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114218 states. [2019-12-18 14:39:41,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114218 states to 114218 states and 477794 transitions. [2019-12-18 14:39:41,872 INFO L78 Accepts]: Start accepts. Automaton has 114218 states and 477794 transitions. Word has length 13 [2019-12-18 14:39:41,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:39:41,874 INFO L462 AbstractCegarLoop]: Abstraction has 114218 states and 477794 transitions. [2019-12-18 14:39:41,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:39:41,874 INFO L276 IsEmpty]: Start isEmpty. Operand 114218 states and 477794 transitions. [2019-12-18 14:39:41,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 14:39:41,877 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:39:41,877 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:39:41,878 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:39:41,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:39:41,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1307118492, now seen corresponding path program 1 times [2019-12-18 14:39:41,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:39:41,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541099097] [2019-12-18 14:39:41,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:39:41,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:39:41,962 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-18 14:39:41,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541099097] [2019-12-18 14:39:41,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:39:41,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:39:41,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046725714] [2019-12-18 14:39:41,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:39:41,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:39:41,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:39:41,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:39:41,964 INFO L87 Difference]: Start difference. First operand 114218 states and 477794 transitions. Second operand 4 states. [2019-12-18 14:39:47,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:39:47,693 INFO L93 Difference]: Finished difference Result 159677 states and 652290 transitions. [2019-12-18 14:39:47,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:39:47,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 14:39:47,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:39:48,240 INFO L225 Difference]: With dead ends: 159677 [2019-12-18 14:39:48,240 INFO L226 Difference]: Without dead ends: 159565 [2019-12-18 14:39:48,240 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-18 14:39:51,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159565 states. [2019-12-18 14:39:54,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159565 to 136035. [2019-12-18 14:39:54,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136035 states. [2019-12-18 14:39:55,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136035 states to 136035 states and 564894 transitions. [2019-12-18 14:39:55,119 INFO L78 Accepts]: Start accepts. Automaton has 136035 states and 564894 transitions. Word has length 13 [2019-12-18 14:39:55,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:39:55,119 INFO L462 AbstractCegarLoop]: Abstraction has 136035 states and 564894 transitions. [2019-12-18 14:39:55,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:39:55,120 INFO L276 IsEmpty]: Start isEmpty. Operand 136035 states and 564894 transitions. [2019-12-18 14:39:55,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 14:39:55,124 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:39:55,124 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:39:55,124 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:39:55,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:39:55,124 INFO L82 PathProgramCache]: Analyzing trace with hash 2137171342, now seen corresponding path program 1 times [2019-12-18 14:39:55,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:39:55,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431760466] [2019-12-18 14:39:55,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:39:55,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:39:55,183 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-18 14:39:55,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431760466] [2019-12-18 14:39:55,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:39:55,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:39:55,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603349357] [2019-12-18 14:39:55,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:39:55,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:39:55,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:39:55,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:39:55,185 INFO L87 Difference]: Start difference. First operand 136035 states and 564894 transitions. Second operand 3 states. [2019-12-18 14:40:00,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:40:00,330 INFO L93 Difference]: Finished difference Result 181618 states and 742473 transitions. [2019-12-18 14:40:00,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:40:00,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-18 14:40:00,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:40:00,927 INFO L225 Difference]: With dead ends: 181618 [2019-12-18 14:40:00,928 INFO L226 Difference]: Without dead ends: 181618 [2019-12-18 14:40:00,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:40:05,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181618 states. [2019-12-18 14:40:08,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181618 to 152081. [2019-12-18 14:40:08,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152081 states. [2019-12-18 14:40:09,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152081 states to 152081 states and 628919 transitions. [2019-12-18 14:40:09,088 INFO L78 Accepts]: Start accepts. Automaton has 152081 states and 628919 transitions. Word has length 14 [2019-12-18 14:40:09,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:40:09,088 INFO L462 AbstractCegarLoop]: Abstraction has 152081 states and 628919 transitions. [2019-12-18 14:40:09,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:40:09,088 INFO L276 IsEmpty]: Start isEmpty. Operand 152081 states and 628919 transitions. [2019-12-18 14:40:09,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 14:40:09,092 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:40:09,092 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:40:09,092 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:40:09,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:40:09,093 INFO L82 PathProgramCache]: Analyzing trace with hash 2137037670, now seen corresponding path program 1 times [2019-12-18 14:40:09,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:40:09,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330400809] [2019-12-18 14:40:09,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:40:09,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:40:09,204 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-18 14:40:09,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330400809] [2019-12-18 14:40:09,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:40:09,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:40:09,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884822398] [2019-12-18 14:40:09,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:40:09,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:40:09,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:40:09,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:40:09,206 INFO L87 Difference]: Start difference. First operand 152081 states and 628919 transitions. Second operand 4 states. [2019-12-18 14:40:15,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:40:15,638 INFO L93 Difference]: Finished difference Result 179622 states and 732719 transitions. [2019-12-18 14:40:15,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:40:15,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 14:40:15,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:40:16,239 INFO L225 Difference]: With dead ends: 179622 [2019-12-18 14:40:16,239 INFO L226 Difference]: Without dead ends: 179542 [2019-12-18 14:40:16,240 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-18 14:40:20,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179542 states. [2019-12-18 14:40:23,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179542 to 157787. [2019-12-18 14:40:23,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157787 states. [2019-12-18 14:40:23,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157787 states to 157787 states and 651479 transitions. [2019-12-18 14:40:23,966 INFO L78 Accepts]: Start accepts. Automaton has 157787 states and 651479 transitions. Word has length 14 [2019-12-18 14:40:23,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:40:23,966 INFO L462 AbstractCegarLoop]: Abstraction has 157787 states and 651479 transitions. [2019-12-18 14:40:23,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:40:23,967 INFO L276 IsEmpty]: Start isEmpty. Operand 157787 states and 651479 transitions. [2019-12-18 14:40:23,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 14:40:23,969 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:40:23,969 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:40:23,969 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:40:23,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:40:23,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1997758702, now seen corresponding path program 1 times [2019-12-18 14:40:23,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:40:23,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582733055] [2019-12-18 14:40:23,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:40:23,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:40:24,029 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-18 14:40:24,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582733055] [2019-12-18 14:40:24,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:40:24,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:40:24,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010144783] [2019-12-18 14:40:24,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:40:24,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:40:24,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:40:24,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:40:24,032 INFO L87 Difference]: Start difference. First operand 157787 states and 651479 transitions. Second operand 4 states. [2019-12-18 14:40:26,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:40:26,302 INFO L93 Difference]: Finished difference Result 189091 states and 772001 transitions. [2019-12-18 14:40:26,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:40:26,304 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 14:40:26,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:40:26,840 INFO L225 Difference]: With dead ends: 189091 [2019-12-18 14:40:26,841 INFO L226 Difference]: Without dead ends: 188995 [2019-12-18 14:40:26,841 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-18 14:40:37,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188995 states. [2019-12-18 14:40:40,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188995 to 161868. [2019-12-18 14:40:40,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161868 states. [2019-12-18 14:40:40,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161868 states to 161868 states and 668265 transitions. [2019-12-18 14:40:40,873 INFO L78 Accepts]: Start accepts. Automaton has 161868 states and 668265 transitions. Word has length 14 [2019-12-18 14:40:40,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:40:40,873 INFO L462 AbstractCegarLoop]: Abstraction has 161868 states and 668265 transitions. [2019-12-18 14:40:40,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:40:40,873 INFO L276 IsEmpty]: Start isEmpty. Operand 161868 states and 668265 transitions. [2019-12-18 14:40:40,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 14:40:40,892 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:40:40,892 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-18 14:40:40,892 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:40:40,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:40:40,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1754746770, now seen corresponding path program 1 times [2019-12-18 14:40:40,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:40:40,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458473591] [2019-12-18 14:40:40,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:40:40,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:40:40,938 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-18 14:40:40,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458473591] [2019-12-18 14:40:40,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:40:40,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:40:40,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778165084] [2019-12-18 14:40:40,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:40:40,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:40:40,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:40:40,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:40:40,940 INFO L87 Difference]: Start difference. First operand 161868 states and 668265 transitions. Second operand 3 states. [2019-12-18 14:40:46,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:40:46,801 INFO L93 Difference]: Finished difference Result 160940 states and 664422 transitions. [2019-12-18 14:40:46,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:40:46,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-18 14:40:46,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:40:47,315 INFO L225 Difference]: With dead ends: 160940 [2019-12-18 14:40:47,316 INFO L226 Difference]: Without dead ends: 160940 [2019-12-18 14:40:47,316 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-18 14:40:51,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160940 states. [2019-12-18 14:40:53,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160940 to 160940. [2019-12-18 14:40:53,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160940 states. [2019-12-18 14:40:55,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160940 states to 160940 states and 664422 transitions. [2019-12-18 14:40:55,304 INFO L78 Accepts]: Start accepts. Automaton has 160940 states and 664422 transitions. Word has length 18 [2019-12-18 14:40:55,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:40:55,304 INFO L462 AbstractCegarLoop]: Abstraction has 160940 states and 664422 transitions. [2019-12-18 14:40:55,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:40:55,305 INFO L276 IsEmpty]: Start isEmpty. Operand 160940 states and 664422 transitions. [2019-12-18 14:40:55,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 14:40:55,324 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:40:55,324 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:40:55,325 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:40:55,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:40:55,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1406595818, now seen corresponding path program 1 times [2019-12-18 14:40:55,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:40:55,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849225318] [2019-12-18 14:40:55,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:40:55,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:40:55,376 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-18 14:40:55,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849225318] [2019-12-18 14:40:55,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:40:55,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:40:55,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591555192] [2019-12-18 14:40:55,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:40:55,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:40:55,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:40:55,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:40:55,378 INFO L87 Difference]: Start difference. First operand 160940 states and 664422 transitions. Second operand 4 states. [2019-12-18 14:41:03,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:03,231 INFO L93 Difference]: Finished difference Result 255238 states and 1058186 transitions. [2019-12-18 14:41:03,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:41:03,231 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-18 14:41:03,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:03,704 INFO L225 Difference]: With dead ends: 255238 [2019-12-18 14:41:03,704 INFO L226 Difference]: Without dead ends: 128270 [2019-12-18 14:41:03,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-18 14:41:06,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128270 states. [2019-12-18 14:41:08,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128270 to 128270. [2019-12-18 14:41:08,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128270 states. [2019-12-18 14:41:09,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128270 states to 128270 states and 523459 transitions. [2019-12-18 14:41:09,905 INFO L78 Accepts]: Start accepts. Automaton has 128270 states and 523459 transitions. Word has length 19 [2019-12-18 14:41:09,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:09,905 INFO L462 AbstractCegarLoop]: Abstraction has 128270 states and 523459 transitions. [2019-12-18 14:41:09,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:41:09,906 INFO L276 IsEmpty]: Start isEmpty. Operand 128270 states and 523459 transitions. [2019-12-18 14:41:09,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 14:41:09,924 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:09,924 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:41:09,924 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:09,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:09,925 INFO L82 PathProgramCache]: Analyzing trace with hash -2069277611, now seen corresponding path program 1 times [2019-12-18 14:41:09,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:09,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906751103] [2019-12-18 14:41:09,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:09,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:10,012 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-18 14:41:10,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906751103] [2019-12-18 14:41:10,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:10,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:41:10,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926160703] [2019-12-18 14:41:10,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:41:10,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:10,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:41:10,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:41:10,016 INFO L87 Difference]: Start difference. First operand 128270 states and 523459 transitions. Second operand 4 states. [2019-12-18 14:41:10,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:10,167 INFO L93 Difference]: Finished difference Result 36423 states and 125388 transitions. [2019-12-18 14:41:10,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:41:10,168 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-18 14:41:10,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:10,217 INFO L225 Difference]: With dead ends: 36423 [2019-12-18 14:41:10,217 INFO L226 Difference]: Without dead ends: 28545 [2019-12-18 14:41:10,218 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-18 14:41:10,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28545 states. [2019-12-18 14:41:10,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28545 to 28545. [2019-12-18 14:41:10,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28545 states. [2019-12-18 14:41:10,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28545 states to 28545 states and 94430 transitions. [2019-12-18 14:41:10,702 INFO L78 Accepts]: Start accepts. Automaton has 28545 states and 94430 transitions. Word has length 19 [2019-12-18 14:41:10,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:10,703 INFO L462 AbstractCegarLoop]: Abstraction has 28545 states and 94430 transitions. [2019-12-18 14:41:10,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:41:10,703 INFO L276 IsEmpty]: Start isEmpty. Operand 28545 states and 94430 transitions. [2019-12-18 14:41:10,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 14:41:10,708 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:10,708 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] [2019-12-18 14:41:10,708 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:10,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:10,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1918737222, now seen corresponding path program 1 times [2019-12-18 14:41:10,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:10,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091625019] [2019-12-18 14:41:10,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:10,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:10,771 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-18 14:41:10,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091625019] [2019-12-18 14:41:10,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:10,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:41:10,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367434756] [2019-12-18 14:41:10,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:41:10,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:10,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:41:10,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:41:10,773 INFO L87 Difference]: Start difference. First operand 28545 states and 94430 transitions. Second operand 5 states. [2019-12-18 14:41:11,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:11,223 INFO L93 Difference]: Finished difference Result 37265 states and 121195 transitions. [2019-12-18 14:41:11,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 14:41:11,224 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 14:41:11,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:11,282 INFO L225 Difference]: With dead ends: 37265 [2019-12-18 14:41:11,282 INFO L226 Difference]: Without dead ends: 36963 [2019-12-18 14:41:11,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:41:13,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36963 states. [2019-12-18 14:41:13,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36963 to 29525. [2019-12-18 14:41:13,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29525 states. [2019-12-18 14:41:13,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29525 states to 29525 states and 97651 transitions. [2019-12-18 14:41:13,766 INFO L78 Accepts]: Start accepts. Automaton has 29525 states and 97651 transitions. Word has length 22 [2019-12-18 14:41:13,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:13,766 INFO L462 AbstractCegarLoop]: Abstraction has 29525 states and 97651 transitions. [2019-12-18 14:41:13,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:41:13,766 INFO L276 IsEmpty]: Start isEmpty. Operand 29525 states and 97651 transitions. [2019-12-18 14:41:13,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 14:41:13,772 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:13,772 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:41:13,773 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:13,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:13,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1233781658, now seen corresponding path program 1 times [2019-12-18 14:41:13,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:13,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919980010] [2019-12-18 14:41:13,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:13,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:13,837 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-18 14:41:13,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919980010] [2019-12-18 14:41:13,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:13,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:41:13,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199753764] [2019-12-18 14:41:13,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:41:13,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:13,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:41:13,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:41:13,840 INFO L87 Difference]: Start difference. First operand 29525 states and 97651 transitions. Second operand 5 states. [2019-12-18 14:41:14,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:14,257 INFO L93 Difference]: Finished difference Result 37362 states and 121787 transitions. [2019-12-18 14:41:14,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 14:41:14,257 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 14:41:14,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:14,317 INFO L225 Difference]: With dead ends: 37362 [2019-12-18 14:41:14,317 INFO L226 Difference]: Without dead ends: 36942 [2019-12-18 14:41:14,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:41:14,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36942 states. [2019-12-18 14:41:14,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36942 to 28461. [2019-12-18 14:41:14,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28461 states. [2019-12-18 14:41:14,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28461 states to 28461 states and 94342 transitions. [2019-12-18 14:41:14,870 INFO L78 Accepts]: Start accepts. Automaton has 28461 states and 94342 transitions. Word has length 22 [2019-12-18 14:41:14,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:14,871 INFO L462 AbstractCegarLoop]: Abstraction has 28461 states and 94342 transitions. [2019-12-18 14:41:14,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:41:14,871 INFO L276 IsEmpty]: Start isEmpty. Operand 28461 states and 94342 transitions. [2019-12-18 14:41:14,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 14:41:14,879 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:14,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] [2019-12-18 14:41:14,879 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:14,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:14,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1628067424, now seen corresponding path program 1 times [2019-12-18 14:41:14,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:14,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226689407] [2019-12-18 14:41:14,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:14,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:15,260 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-18 14:41:15,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226689407] [2019-12-18 14:41:15,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:15,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:41:15,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683246538] [2019-12-18 14:41:15,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:41:15,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:15,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:41:15,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:41:15,264 INFO L87 Difference]: Start difference. First operand 28461 states and 94342 transitions. Second operand 5 states. [2019-12-18 14:41:15,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:15,367 INFO L93 Difference]: Finished difference Result 12955 states and 39860 transitions. [2019-12-18 14:41:15,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:41:15,367 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-18 14:41:15,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:15,382 INFO L225 Difference]: With dead ends: 12955 [2019-12-18 14:41:15,382 INFO L226 Difference]: Without dead ends: 11071 [2019-12-18 14:41:15,383 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-18 14:41:15,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11071 states. [2019-12-18 14:41:15,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11071 to 11023. [2019-12-18 14:41:15,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11023 states. [2019-12-18 14:41:15,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11023 states to 11023 states and 33656 transitions. [2019-12-18 14:41:15,538 INFO L78 Accepts]: Start accepts. Automaton has 11023 states and 33656 transitions. Word has length 25 [2019-12-18 14:41:15,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:15,538 INFO L462 AbstractCegarLoop]: Abstraction has 11023 states and 33656 transitions. [2019-12-18 14:41:15,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:41:15,538 INFO L276 IsEmpty]: Start isEmpty. Operand 11023 states and 33656 transitions. [2019-12-18 14:41:15,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 14:41:15,554 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:15,554 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] [2019-12-18 14:41:15,555 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:15,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:15,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1034846780, now seen corresponding path program 1 times [2019-12-18 14:41:15,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:15,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388072520] [2019-12-18 14:41:15,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:15,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:15,631 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-18 14:41:15,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388072520] [2019-12-18 14:41:15,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:15,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:41:15,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061335334] [2019-12-18 14:41:15,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:41:15,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:15,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:41:15,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:41:15,633 INFO L87 Difference]: Start difference. First operand 11023 states and 33656 transitions. Second operand 3 states. [2019-12-18 14:41:15,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:15,720 INFO L93 Difference]: Finished difference Result 16986 states and 52244 transitions. [2019-12-18 14:41:15,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:41:15,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 14:41:15,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:15,735 INFO L225 Difference]: With dead ends: 16986 [2019-12-18 14:41:15,735 INFO L226 Difference]: Without dead ends: 6707 [2019-12-18 14:41:15,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-18 14:41:15,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6707 states. [2019-12-18 14:41:15,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6707 to 6376. [2019-12-18 14:41:15,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6376 states. [2019-12-18 14:41:15,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6376 states to 6376 states and 19609 transitions. [2019-12-18 14:41:15,883 INFO L78 Accepts]: Start accepts. Automaton has 6376 states and 19609 transitions. Word has length 39 [2019-12-18 14:41:15,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:15,883 INFO L462 AbstractCegarLoop]: Abstraction has 6376 states and 19609 transitions. [2019-12-18 14:41:15,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:41:15,884 INFO L276 IsEmpty]: Start isEmpty. Operand 6376 states and 19609 transitions. [2019-12-18 14:41:15,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 14:41:15,896 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:15,896 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] [2019-12-18 14:41:15,897 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:15,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:15,897 INFO L82 PathProgramCache]: Analyzing trace with hash 483024013, now seen corresponding path program 1 times [2019-12-18 14:41:15,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:15,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329375639] [2019-12-18 14:41:15,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:15,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:16,029 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-18 14:41:16,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329375639] [2019-12-18 14:41:16,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:16,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:41:16,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471477158] [2019-12-18 14:41:16,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:41:16,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:16,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:41:16,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:41:16,032 INFO L87 Difference]: Start difference. First operand 6376 states and 19609 transitions. Second operand 6 states. [2019-12-18 14:41:16,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:16,256 INFO L93 Difference]: Finished difference Result 6540 states and 19923 transitions. [2019-12-18 14:41:16,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 14:41:16,256 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-18 14:41:16,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:16,267 INFO L225 Difference]: With dead ends: 6540 [2019-12-18 14:41:16,267 INFO L226 Difference]: Without dead ends: 6274 [2019-12-18 14:41:16,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:41:16,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6274 states. [2019-12-18 14:41:16,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6274 to 6274. [2019-12-18 14:41:16,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6274 states. [2019-12-18 14:41:16,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6274 states to 6274 states and 19376 transitions. [2019-12-18 14:41:16,372 INFO L78 Accepts]: Start accepts. Automaton has 6274 states and 19376 transitions. Word has length 40 [2019-12-18 14:41:16,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:16,373 INFO L462 AbstractCegarLoop]: Abstraction has 6274 states and 19376 transitions. [2019-12-18 14:41:16,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:41:16,373 INFO L276 IsEmpty]: Start isEmpty. Operand 6274 states and 19376 transitions. [2019-12-18 14:41:16,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 14:41:16,381 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:16,381 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] [2019-12-18 14:41:16,381 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:16,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:16,382 INFO L82 PathProgramCache]: Analyzing trace with hash -2063605447, now seen corresponding path program 1 times [2019-12-18 14:41:16,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:16,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146269759] [2019-12-18 14:41:16,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:16,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:16,423 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-18 14:41:16,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146269759] [2019-12-18 14:41:16,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:16,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:41:16,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175829281] [2019-12-18 14:41:16,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:41:16,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:16,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:41:16,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:41:16,425 INFO L87 Difference]: Start difference. First operand 6274 states and 19376 transitions. Second operand 3 states. [2019-12-18 14:41:16,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:16,481 INFO L93 Difference]: Finished difference Result 7938 states and 23921 transitions. [2019-12-18 14:41:16,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:41:16,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-18 14:41:16,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:16,492 INFO L225 Difference]: With dead ends: 7938 [2019-12-18 14:41:16,492 INFO L226 Difference]: Without dead ends: 7938 [2019-12-18 14:41:16,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:41:16,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7938 states. [2019-12-18 14:41:16,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7938 to 6586. [2019-12-18 14:41:16,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6586 states. [2019-12-18 14:41:16,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6586 states to 6586 states and 20115 transitions. [2019-12-18 14:41:16,602 INFO L78 Accepts]: Start accepts. Automaton has 6586 states and 20115 transitions. Word has length 40 [2019-12-18 14:41:16,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:16,603 INFO L462 AbstractCegarLoop]: Abstraction has 6586 states and 20115 transitions. [2019-12-18 14:41:16,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:41:16,603 INFO L276 IsEmpty]: Start isEmpty. Operand 6586 states and 20115 transitions. [2019-12-18 14:41:16,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 14:41:16,615 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:16,615 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] [2019-12-18 14:41:16,616 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:16,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:16,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1230367192, now seen corresponding path program 1 times [2019-12-18 14:41:16,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:16,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013870437] [2019-12-18 14:41:16,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:16,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:16,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:41:16,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013870437] [2019-12-18 14:41:16,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:16,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:41:16,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680282892] [2019-12-18 14:41:16,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:41:16,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:16,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:41:16,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:41:16,692 INFO L87 Difference]: Start difference. First operand 6586 states and 20115 transitions. Second operand 5 states. [2019-12-18 14:41:17,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:17,271 INFO L93 Difference]: Finished difference Result 11735 states and 35030 transitions. [2019-12-18 14:41:17,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:41:17,271 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 14:41:17,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:17,293 INFO L225 Difference]: With dead ends: 11735 [2019-12-18 14:41:17,294 INFO L226 Difference]: Without dead ends: 11735 [2019-12-18 14:41:17,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:41:17,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11735 states. [2019-12-18 14:41:17,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11735 to 10843. [2019-12-18 14:41:17,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10843 states. [2019-12-18 14:41:17,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10843 states to 10843 states and 32569 transitions. [2019-12-18 14:41:17,493 INFO L78 Accepts]: Start accepts. Automaton has 10843 states and 32569 transitions. Word has length 40 [2019-12-18 14:41:17,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:17,493 INFO L462 AbstractCegarLoop]: Abstraction has 10843 states and 32569 transitions. [2019-12-18 14:41:17,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:41:17,494 INFO L276 IsEmpty]: Start isEmpty. Operand 10843 states and 32569 transitions. [2019-12-18 14:41:17,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 14:41:17,507 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:17,507 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:41:17,508 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:17,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:17,508 INFO L82 PathProgramCache]: Analyzing trace with hash -891252526, now seen corresponding path program 2 times [2019-12-18 14:41:17,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:17,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332106515] [2019-12-18 14:41:17,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:17,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:17,590 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-18 14:41:17,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332106515] [2019-12-18 14:41:17,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:17,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:41:17,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289729019] [2019-12-18 14:41:17,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:41:17,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:17,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:41:17,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:41:17,592 INFO L87 Difference]: Start difference. First operand 10843 states and 32569 transitions. Second operand 6 states. [2019-12-18 14:41:18,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:18,683 INFO L93 Difference]: Finished difference Result 20965 states and 62807 transitions. [2019-12-18 14:41:18,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:41:18,683 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-18 14:41:18,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:18,715 INFO L225 Difference]: With dead ends: 20965 [2019-12-18 14:41:18,715 INFO L226 Difference]: Without dead ends: 20965 [2019-12-18 14:41:18,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:41:18,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20965 states. [2019-12-18 14:41:18,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20965 to 13762. [2019-12-18 14:41:18,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13762 states. [2019-12-18 14:41:18,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13762 states to 13762 states and 41476 transitions. [2019-12-18 14:41:18,960 INFO L78 Accepts]: Start accepts. Automaton has 13762 states and 41476 transitions. Word has length 40 [2019-12-18 14:41:18,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:18,960 INFO L462 AbstractCegarLoop]: Abstraction has 13762 states and 41476 transitions. [2019-12-18 14:41:18,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:41:18,960 INFO L276 IsEmpty]: Start isEmpty. Operand 13762 states and 41476 transitions. [2019-12-18 14:41:18,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 14:41:18,976 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:18,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:41:18,976 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:18,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:18,976 INFO L82 PathProgramCache]: Analyzing trace with hash 820794198, now seen corresponding path program 3 times [2019-12-18 14:41:18,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:18,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164832871] [2019-12-18 14:41:18,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:18,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:19,058 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-18 14:41:19,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164832871] [2019-12-18 14:41:19,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:19,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:41:19,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094650392] [2019-12-18 14:41:19,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:41:19,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:19,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:41:19,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:41:19,061 INFO L87 Difference]: Start difference. First operand 13762 states and 41476 transitions. Second operand 3 states. [2019-12-18 14:41:19,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:19,130 INFO L93 Difference]: Finished difference Result 13682 states and 41189 transitions. [2019-12-18 14:41:19,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:41:19,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-18 14:41:19,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:19,149 INFO L225 Difference]: With dead ends: 13682 [2019-12-18 14:41:19,149 INFO L226 Difference]: Without dead ends: 13682 [2019-12-18 14:41:19,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:41:19,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13682 states. [2019-12-18 14:41:19,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13682 to 11317. [2019-12-18 14:41:19,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11317 states. [2019-12-18 14:41:19,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11317 states to 11317 states and 34449 transitions. [2019-12-18 14:41:19,339 INFO L78 Accepts]: Start accepts. Automaton has 11317 states and 34449 transitions. Word has length 40 [2019-12-18 14:41:19,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:19,339 INFO L462 AbstractCegarLoop]: Abstraction has 11317 states and 34449 transitions. [2019-12-18 14:41:19,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:41:19,339 INFO L276 IsEmpty]: Start isEmpty. Operand 11317 states and 34449 transitions. [2019-12-18 14:41:19,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 14:41:19,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:19,352 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] [2019-12-18 14:41:19,352 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:19,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:19,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1848652026, now seen corresponding path program 1 times [2019-12-18 14:41:19,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:19,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765654993] [2019-12-18 14:41:19,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:19,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:19,421 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-18 14:41:19,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765654993] [2019-12-18 14:41:19,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:19,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:41:19,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63751963] [2019-12-18 14:41:19,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:41:19,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:19,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:41:19,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:41:19,423 INFO L87 Difference]: Start difference. First operand 11317 states and 34449 transitions. Second operand 6 states. [2019-12-18 14:41:19,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:19,683 INFO L93 Difference]: Finished difference Result 11303 states and 34416 transitions. [2019-12-18 14:41:19,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:41:19,684 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-18 14:41:19,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:19,705 INFO L225 Difference]: With dead ends: 11303 [2019-12-18 14:41:19,705 INFO L226 Difference]: Without dead ends: 10961 [2019-12-18 14:41:19,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:41:19,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10961 states. [2019-12-18 14:41:19,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10961 to 10961. [2019-12-18 14:41:19,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10961 states. [2019-12-18 14:41:19,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10961 states to 10961 states and 33758 transitions. [2019-12-18 14:41:19,897 INFO L78 Accepts]: Start accepts. Automaton has 10961 states and 33758 transitions. Word has length 41 [2019-12-18 14:41:19,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:19,897 INFO L462 AbstractCegarLoop]: Abstraction has 10961 states and 33758 transitions. [2019-12-18 14:41:19,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:41:19,897 INFO L276 IsEmpty]: Start isEmpty. Operand 10961 states and 33758 transitions. [2019-12-18 14:41:19,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 14:41:19,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:19,911 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] [2019-12-18 14:41:19,911 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:19,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:19,912 INFO L82 PathProgramCache]: Analyzing trace with hash 685009244, now seen corresponding path program 1 times [2019-12-18 14:41:19,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:19,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693796841] [2019-12-18 14:41:19,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:19,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:19,979 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-18 14:41:19,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693796841] [2019-12-18 14:41:19,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:19,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:41:19,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850087563] [2019-12-18 14:41:19,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:41:19,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:19,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:41:19,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:41:19,981 INFO L87 Difference]: Start difference. First operand 10961 states and 33758 transitions. Second operand 6 states. [2019-12-18 14:41:20,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:20,082 INFO L93 Difference]: Finished difference Result 10006 states and 31412 transitions. [2019-12-18 14:41:20,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:41:20,082 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-18 14:41:20,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:20,099 INFO L225 Difference]: With dead ends: 10006 [2019-12-18 14:41:20,099 INFO L226 Difference]: Without dead ends: 9901 [2019-12-18 14:41:20,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:41:20,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9901 states. [2019-12-18 14:41:20,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9901 to 9846. [2019-12-18 14:41:20,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9846 states. [2019-12-18 14:41:20,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9846 states to 9846 states and 31016 transitions. [2019-12-18 14:41:20,261 INFO L78 Accepts]: Start accepts. Automaton has 9846 states and 31016 transitions. Word has length 41 [2019-12-18 14:41:20,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:20,262 INFO L462 AbstractCegarLoop]: Abstraction has 9846 states and 31016 transitions. [2019-12-18 14:41:20,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:41:20,262 INFO L276 IsEmpty]: Start isEmpty. Operand 9846 states and 31016 transitions. [2019-12-18 14:41:20,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 14:41:20,278 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:20,278 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:41:20,278 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:20,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:20,278 INFO L82 PathProgramCache]: Analyzing trace with hash 92371973, now seen corresponding path program 1 times [2019-12-18 14:41:20,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:20,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567464697] [2019-12-18 14:41:20,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:20,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:20,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:41:20,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567464697] [2019-12-18 14:41:20,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:20,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 14:41:20,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219071451] [2019-12-18 14:41:20,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 14:41:20,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:20,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 14:41:20,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:41:20,390 INFO L87 Difference]: Start difference. First operand 9846 states and 31016 transitions. Second operand 8 states. [2019-12-18 14:41:21,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:21,378 INFO L93 Difference]: Finished difference Result 18711 states and 57563 transitions. [2019-12-18 14:41:21,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 14:41:21,379 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-12-18 14:41:21,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:21,415 INFO L225 Difference]: With dead ends: 18711 [2019-12-18 14:41:21,416 INFO L226 Difference]: Without dead ends: 13830 [2019-12-18 14:41:21,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2019-12-18 14:41:21,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13830 states. [2019-12-18 14:41:21,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13830 to 11317. [2019-12-18 14:41:21,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11317 states. [2019-12-18 14:41:21,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11317 states to 11317 states and 35333 transitions. [2019-12-18 14:41:21,712 INFO L78 Accepts]: Start accepts. Automaton has 11317 states and 35333 transitions. Word has length 55 [2019-12-18 14:41:21,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:21,712 INFO L462 AbstractCegarLoop]: Abstraction has 11317 states and 35333 transitions. [2019-12-18 14:41:21,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 14:41:21,713 INFO L276 IsEmpty]: Start isEmpty. Operand 11317 states and 35333 transitions. [2019-12-18 14:41:21,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 14:41:21,730 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:21,730 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:41:21,730 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:21,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:21,731 INFO L82 PathProgramCache]: Analyzing trace with hash 62198309, now seen corresponding path program 2 times [2019-12-18 14:41:21,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:21,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475790907] [2019-12-18 14:41:21,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:21,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:21,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:41:21,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475790907] [2019-12-18 14:41:21,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:21,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:41:21,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555027594] [2019-12-18 14:41:21,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:41:21,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:21,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:41:21,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:41:21,815 INFO L87 Difference]: Start difference. First operand 11317 states and 35333 transitions. Second operand 7 states. [2019-12-18 14:41:22,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:22,068 INFO L93 Difference]: Finished difference Result 19372 states and 59250 transitions. [2019-12-18 14:41:22,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 14:41:22,069 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-12-18 14:41:22,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:22,091 INFO L225 Difference]: With dead ends: 19372 [2019-12-18 14:41:22,091 INFO L226 Difference]: Without dead ends: 14143 [2019-12-18 14:41:22,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:41:22,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14143 states. [2019-12-18 14:41:22,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14143 to 13246. [2019-12-18 14:41:22,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13246 states. [2019-12-18 14:41:22,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13246 states to 13246 states and 40719 transitions. [2019-12-18 14:41:22,302 INFO L78 Accepts]: Start accepts. Automaton has 13246 states and 40719 transitions. Word has length 55 [2019-12-18 14:41:22,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:22,302 INFO L462 AbstractCegarLoop]: Abstraction has 13246 states and 40719 transitions. [2019-12-18 14:41:22,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:41:22,302 INFO L276 IsEmpty]: Start isEmpty. Operand 13246 states and 40719 transitions. [2019-12-18 14:41:22,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 14:41:22,317 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:22,317 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:41:22,317 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:22,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:22,317 INFO L82 PathProgramCache]: Analyzing trace with hash -435713207, now seen corresponding path program 3 times [2019-12-18 14:41:22,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:22,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913202171] [2019-12-18 14:41:22,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:22,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:22,380 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-18 14:41:22,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913202171] [2019-12-18 14:41:22,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:22,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:41:22,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666287714] [2019-12-18 14:41:22,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:41:22,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:22,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:41:22,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:41:22,383 INFO L87 Difference]: Start difference. First operand 13246 states and 40719 transitions. Second operand 7 states. [2019-12-18 14:41:22,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:22,625 INFO L93 Difference]: Finished difference Result 20485 states and 61956 transitions. [2019-12-18 14:41:22,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 14:41:22,626 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-12-18 14:41:22,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:22,648 INFO L225 Difference]: With dead ends: 20485 [2019-12-18 14:41:22,648 INFO L226 Difference]: Without dead ends: 15613 [2019-12-18 14:41:22,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:41:22,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15613 states. [2019-12-18 14:41:22,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15613 to 13283. [2019-12-18 14:41:22,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13283 states. [2019-12-18 14:41:22,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13283 states to 13283 states and 40785 transitions. [2019-12-18 14:41:22,866 INFO L78 Accepts]: Start accepts. Automaton has 13283 states and 40785 transitions. Word has length 55 [2019-12-18 14:41:22,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:22,866 INFO L462 AbstractCegarLoop]: Abstraction has 13283 states and 40785 transitions. [2019-12-18 14:41:22,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:41:22,866 INFO L276 IsEmpty]: Start isEmpty. Operand 13283 states and 40785 transitions. [2019-12-18 14:41:22,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 14:41:22,884 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:22,884 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:41:22,884 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:22,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:22,884 INFO L82 PathProgramCache]: Analyzing trace with hash -808118167, now seen corresponding path program 4 times [2019-12-18 14:41:22,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:22,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73206580] [2019-12-18 14:41:22,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:22,980 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-18 14:41:22,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73206580] [2019-12-18 14:41:22,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:22,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 14:41:22,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792717123] [2019-12-18 14:41:22,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 14:41:22,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:22,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 14:41:22,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:41:22,984 INFO L87 Difference]: Start difference. First operand 13283 states and 40785 transitions. Second operand 9 states. [2019-12-18 14:41:23,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:23,993 INFO L93 Difference]: Finished difference Result 23536 states and 71056 transitions. [2019-12-18 14:41:23,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 14:41:23,994 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-18 14:41:23,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:24,026 INFO L225 Difference]: With dead ends: 23536 [2019-12-18 14:41:24,027 INFO L226 Difference]: Without dead ends: 22230 [2019-12-18 14:41:24,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2019-12-18 14:41:24,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22230 states. [2019-12-18 14:41:24,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22230 to 13143. [2019-12-18 14:41:24,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13143 states. [2019-12-18 14:41:24,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13143 states to 13143 states and 40364 transitions. [2019-12-18 14:41:24,294 INFO L78 Accepts]: Start accepts. Automaton has 13143 states and 40364 transitions. Word has length 55 [2019-12-18 14:41:24,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:24,294 INFO L462 AbstractCegarLoop]: Abstraction has 13143 states and 40364 transitions. [2019-12-18 14:41:24,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 14:41:24,294 INFO L276 IsEmpty]: Start isEmpty. Operand 13143 states and 40364 transitions. [2019-12-18 14:41:24,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 14:41:24,310 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:24,310 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:41:24,310 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:24,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:24,310 INFO L82 PathProgramCache]: Analyzing trace with hash 2126472303, now seen corresponding path program 5 times [2019-12-18 14:41:24,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:24,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042794916] [2019-12-18 14:41:24,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:24,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:24,406 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-18 14:41:24,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042794916] [2019-12-18 14:41:24,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:24,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 14:41:24,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237807203] [2019-12-18 14:41:24,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 14:41:24,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:24,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 14:41:24,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:41:24,408 INFO L87 Difference]: Start difference. First operand 13143 states and 40364 transitions. Second operand 9 states. [2019-12-18 14:41:25,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:25,292 INFO L93 Difference]: Finished difference Result 31376 states and 94703 transitions. [2019-12-18 14:41:25,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 14:41:25,292 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-18 14:41:25,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:25,336 INFO L225 Difference]: With dead ends: 31376 [2019-12-18 14:41:25,336 INFO L226 Difference]: Without dead ends: 30134 [2019-12-18 14:41:25,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-18 14:41:25,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30134 states. [2019-12-18 14:41:25,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30134 to 13164. [2019-12-18 14:41:25,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13164 states. [2019-12-18 14:41:25,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13164 states to 13164 states and 40462 transitions. [2019-12-18 14:41:25,664 INFO L78 Accepts]: Start accepts. Automaton has 13164 states and 40462 transitions. Word has length 55 [2019-12-18 14:41:25,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:25,665 INFO L462 AbstractCegarLoop]: Abstraction has 13164 states and 40462 transitions. [2019-12-18 14:41:25,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 14:41:25,666 INFO L276 IsEmpty]: Start isEmpty. Operand 13164 states and 40462 transitions. [2019-12-18 14:41:25,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 14:41:25,688 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:25,688 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:41:25,688 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:25,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:25,688 INFO L82 PathProgramCache]: Analyzing trace with hash -655607069, now seen corresponding path program 6 times [2019-12-18 14:41:25,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:25,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257243612] [2019-12-18 14:41:25,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:25,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:25,737 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-18 14:41:25,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257243612] [2019-12-18 14:41:25,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:25,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:41:25,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616498187] [2019-12-18 14:41:25,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:41:25,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:25,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:41:25,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:41:25,739 INFO L87 Difference]: Start difference. First operand 13164 states and 40462 transitions. Second operand 3 states. [2019-12-18 14:41:25,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:25,786 INFO L93 Difference]: Finished difference Result 8642 states and 26236 transitions. [2019-12-18 14:41:25,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:41:25,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 14:41:25,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:25,802 INFO L225 Difference]: With dead ends: 8642 [2019-12-18 14:41:25,802 INFO L226 Difference]: Without dead ends: 8642 [2019-12-18 14:41:25,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:41:25,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8642 states. [2019-12-18 14:41:25,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8642 to 8482. [2019-12-18 14:41:25,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8482 states. [2019-12-18 14:41:25,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8482 states to 8482 states and 25789 transitions. [2019-12-18 14:41:25,962 INFO L78 Accepts]: Start accepts. Automaton has 8482 states and 25789 transitions. Word has length 55 [2019-12-18 14:41:25,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:25,962 INFO L462 AbstractCegarLoop]: Abstraction has 8482 states and 25789 transitions. [2019-12-18 14:41:25,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:41:25,962 INFO L276 IsEmpty]: Start isEmpty. Operand 8482 states and 25789 transitions. [2019-12-18 14:41:25,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:41:25,971 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:25,971 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:41:25,971 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:25,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:25,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1033271685, now seen corresponding path program 1 times [2019-12-18 14:41:25,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:25,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498569147] [2019-12-18 14:41:25,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:25,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:26,431 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-18 14:41:26,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498569147] [2019-12-18 14:41:26,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:26,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 14:41:26,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353026573] [2019-12-18 14:41:26,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 14:41:26,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:26,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 14:41:26,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-18 14:41:26,433 INFO L87 Difference]: Start difference. First operand 8482 states and 25789 transitions. Second operand 14 states. [2019-12-18 14:41:29,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:29,474 INFO L93 Difference]: Finished difference Result 14591 states and 43804 transitions. [2019-12-18 14:41:29,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-18 14:41:29,474 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2019-12-18 14:41:29,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:29,491 INFO L225 Difference]: With dead ends: 14591 [2019-12-18 14:41:29,491 INFO L226 Difference]: Without dead ends: 9887 [2019-12-18 14:41:29,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=348, Invalid=1374, Unknown=0, NotChecked=0, Total=1722 [2019-12-18 14:41:29,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9887 states. [2019-12-18 14:41:29,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9887 to 8674. [2019-12-18 14:41:29,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8674 states. [2019-12-18 14:41:29,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8674 states to 8674 states and 25947 transitions. [2019-12-18 14:41:29,631 INFO L78 Accepts]: Start accepts. Automaton has 8674 states and 25947 transitions. Word has length 56 [2019-12-18 14:41:29,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:29,631 INFO L462 AbstractCegarLoop]: Abstraction has 8674 states and 25947 transitions. [2019-12-18 14:41:29,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 14:41:29,632 INFO L276 IsEmpty]: Start isEmpty. Operand 8674 states and 25947 transitions. [2019-12-18 14:41:29,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:41:29,641 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:29,641 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:41:29,642 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:29,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:29,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1822247207, now seen corresponding path program 2 times [2019-12-18 14:41:29,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:29,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958917673] [2019-12-18 14:41:29,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:29,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:41:30,050 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-18 14:41:30,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958917673] [2019-12-18 14:41:30,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:41:30,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 14:41:30,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025423218] [2019-12-18 14:41:30,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 14:41:30,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:41:30,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 14:41:30,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-12-18 14:41:30,052 INFO L87 Difference]: Start difference. First operand 8674 states and 25947 transitions. Second operand 15 states. [2019-12-18 14:41:32,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:41:32,242 INFO L93 Difference]: Finished difference Result 10289 states and 30211 transitions. [2019-12-18 14:41:32,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 14:41:32,242 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-12-18 14:41:32,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:41:32,257 INFO L225 Difference]: With dead ends: 10289 [2019-12-18 14:41:32,257 INFO L226 Difference]: Without dead ends: 9691 [2019-12-18 14:41:32,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=219, Invalid=903, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 14:41:32,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9691 states. [2019-12-18 14:41:32,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9691 to 8356. [2019-12-18 14:41:32,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8356 states. [2019-12-18 14:41:32,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8356 states to 8356 states and 25083 transitions. [2019-12-18 14:41:32,391 INFO L78 Accepts]: Start accepts. Automaton has 8356 states and 25083 transitions. Word has length 56 [2019-12-18 14:41:32,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:41:32,391 INFO L462 AbstractCegarLoop]: Abstraction has 8356 states and 25083 transitions. [2019-12-18 14:41:32,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 14:41:32,391 INFO L276 IsEmpty]: Start isEmpty. Operand 8356 states and 25083 transitions. [2019-12-18 14:41:32,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:41:32,400 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:41:32,400 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:41:32,400 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:41:32,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:41:32,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1734091201, now seen corresponding path program 3 times [2019-12-18 14:41:32,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:41:32,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054141766] [2019-12-18 14:41:32,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:41:32,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:41:32,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:41:32,599 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 14:41:32,599 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 14:41:32,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= 0 v_~__unbuffered_cnt~0_95) (= 0 v_~x~0_240) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2076~0.base_30|) (= v_~x$r_buff1_thd0~0_309 0) (= v_~weak$$choice2~0_201 0) (= 0 v_~x$w_buff1_used~0_624) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t2076~0.base_30| 1)) (= 0 v_~x$r_buff1_thd2~0_264) (= v_~y~0_226 0) (= v_~z~0_95 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$r_buff0_thd3~0_148) (= |v_ULTIMATE.start_main_~#t2076~0.offset_22| 0) (= 0 v_~x$w_buff1~0_328) (= 0 v_~x$r_buff0_thd2~0_323) (= v_~x$flush_delayed~0_62 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2076~0.base_30|) 0) (= 0 v_~x$w_buff0_used~0_913) (= 0 |v_#NULL.base_4|) (= 0 v_~x$read_delayed~0_7) (= v_~x$r_buff0_thd1~0_362 0) (= 0 v_~weak$$choice0~0_37) (= v_~main$tmp_guard1~0_53 0) (= v_~main$tmp_guard0~0_42 0) (= 0 v_~__unbuffered_p0_EAX~0_85) (= 0 v_~__unbuffered_p2_EAX~0_68) (= |v_#NULL.offset_4| 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2076~0.base_30| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2076~0.base_30|) |v_ULTIMATE.start_main_~#t2076~0.offset_22| 0)) |v_#memory_int_23|) (= 0 v_~x$r_buff1_thd3~0_267) (= v_~x$mem_tmp~0_40 0) (= v_~x$r_buff1_thd1~0_428 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2076~0.base_30| 4)) (= 0 v_~x$w_buff0~0_403) (= v_~x$r_buff0_thd0~0_156 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_403, ~x$flush_delayed~0=v_~x$flush_delayed~0_62, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_428, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_148, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_40|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ULTIMATE.start_main_~#t2078~0.base=|v_ULTIMATE.start_main_~#t2078~0.base_23|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_85, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_68, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_156, ~x$w_buff1~0=v_~x$w_buff1~0_328, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_624, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_264, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_37, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95, ~x~0=v_~x~0_240, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_362, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_114|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_267, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_53, ~x$mem_tmp~0=v_~x$mem_tmp~0_40, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_51|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_60|, ULTIMATE.start_main_~#t2078~0.offset=|v_ULTIMATE.start_main_~#t2078~0.offset_14|, ~y~0=v_~y~0_226, ULTIMATE.start_main_~#t2076~0.base=|v_ULTIMATE.start_main_~#t2076~0.base_30|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_15|, ULTIMATE.start_main_~#t2077~0.base=|v_ULTIMATE.start_main_~#t2077~0.base_31|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_42, ULTIMATE.start_main_~#t2077~0.offset=|v_ULTIMATE.start_main_~#t2077~0.offset_22|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_309, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_323, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_913, ULTIMATE.start_main_~#t2076~0.offset=|v_ULTIMATE.start_main_~#t2076~0.offset_22|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_62|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_95, ~weak$$choice2~0=v_~weak$$choice2~0_201, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t2078~0.base, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2078~0.offset, ~y~0, ULTIMATE.start_main_~#t2076~0.base, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~x$w_buff1~0, ULTIMATE.start_main_~#t2077~0.base, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2077~0.offset, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t2076~0.offset, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 14:41:32,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L818-1-->L820: Formula: (and (= |v_ULTIMATE.start_main_~#t2077~0.offset_9| 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2077~0.base_10| 4) |v_#length_15|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2077~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2077~0.base_10|) |v_ULTIMATE.start_main_~#t2077~0.offset_9| 1)) |v_#memory_int_15|) (not (= 0 |v_ULTIMATE.start_main_~#t2077~0.base_10|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2077~0.base_10|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2077~0.base_10| 1)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2077~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2077~0.base=|v_ULTIMATE.start_main_~#t2077~0.base_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2077~0.offset=|v_ULTIMATE.start_main_~#t2077~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2077~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2077~0.offset] because there is no mapped edge [2019-12-18 14:41:32,605 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] P1ENTRY-->L5-3: Formula: (and (= v_~x$w_buff0~0_21 v_~x$w_buff1~0_19) (= v_P1Thread1of1ForFork0_~arg.offset_6 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= v_P1Thread1of1ForFork0_~arg.base_6 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= 0 (mod v_~x$w_buff1_used~0_52 256)) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|) (= v_~x$w_buff1_used~0_52 v_~x$w_buff0_used~0_98) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|) (= 1 v_~x$w_buff0_used~0_97) (= 1 v_~x$w_buff0~0_20)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_21, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_98} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_20, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_6, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_6, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|, ~x$w_buff1~0=v_~x$w_buff1~0_19, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_52, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_97} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 14:41:32,607 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L820-1-->L822: Formula: (and (= |v_ULTIMATE.start_main_~#t2078~0.offset_10| 0) (not (= |v_ULTIMATE.start_main_~#t2078~0.base_11| 0)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2078~0.base_11|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2078~0.base_11| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2078~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2078~0.base_11|) |v_ULTIMATE.start_main_~#t2078~0.offset_10| 2)) |v_#memory_int_13|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2078~0.base_11|)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2078~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2078~0.offset=|v_ULTIMATE.start_main_~#t2078~0.offset_10|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|, ULTIMATE.start_main_~#t2078~0.base=|v_ULTIMATE.start_main_~#t2078~0.base_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t2078~0.offset, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2078~0.base] because there is no mapped edge [2019-12-18 14:41:32,609 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L795-2-->L795-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd3~0_In-1480452251 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-1480452251 256) 0))) (or (and (= ~x$w_buff1~0_In-1480452251 |P2Thread1of1ForFork1_#t~ite32_Out-1480452251|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x~0_In-1480452251 |P2Thread1of1ForFork1_#t~ite32_Out-1480452251|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1480452251, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1480452251, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1480452251, ~x~0=~x~0_In-1480452251} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-1480452251|, ~x$w_buff1~0=~x$w_buff1~0_In-1480452251, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1480452251, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1480452251, ~x~0=~x~0_In-1480452251} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 14:41:32,610 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L795-4-->L796: Formula: (= v_~x~0_21 |v_P2Thread1of1ForFork1_#t~ite32_10|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_10|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_9|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_13|, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-18 14:41:32,610 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L796-->L796-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In2128995611 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In2128995611 256)))) (or (and (= ~x$w_buff0_used~0_In2128995611 |P2Thread1of1ForFork1_#t~ite34_Out2128995611|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out2128995611|) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2128995611, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2128995611} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out2128995611|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2128995611, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2128995611} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 14:41:32,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L776-->L776-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-2098364077 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-2098364077 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out-2098364077| ~x$w_buff0_used~0_In-2098364077) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out-2098364077| 0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2098364077, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2098364077} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2098364077, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-2098364077|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2098364077} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 14:41:32,613 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L777-->L777-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In248783559 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In248783559 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In248783559 256))) (.cse3 (= (mod ~x$r_buff1_thd2~0_In248783559 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite29_Out248783559| ~x$w_buff1_used~0_In248783559) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork0_#t~ite29_Out248783559| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In248783559, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In248783559, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In248783559, ~x$w_buff0_used~0=~x$w_buff0_used~0_In248783559} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In248783559, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In248783559, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In248783559, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out248783559|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In248783559} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 14:41:32,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L778-->L779: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In1779843653 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1779843653 256)))) (or (and (= ~x$r_buff0_thd2~0_In1779843653 ~x$r_buff0_thd2~0_Out1779843653) (or .cse0 .cse1)) (and (= 0 ~x$r_buff0_thd2~0_Out1779843653) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1779843653, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1779843653} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1779843653|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1779843653, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1779843653} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 14:41:32,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In1700794833 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In1700794833 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In1700794833 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In1700794833 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite31_Out1700794833| ~x$r_buff1_thd2~0_In1700794833) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out1700794833|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1700794833, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1700794833, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1700794833, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1700794833} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1700794833|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1700794833, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1700794833, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1700794833, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1700794833} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 14:41:32,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L779-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd2~0_46 |v_P1Thread1of1ForFork0_#t~ite31_30|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_29|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_46, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 14:41:32,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L740-->L740-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In732166358 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite9_Out732166358| ~x$w_buff0~0_In732166358) (= |P0Thread1of1ForFork2_#t~ite8_In732166358| |P0Thread1of1ForFork2_#t~ite8_Out732166358|)) (and (= |P0Thread1of1ForFork2_#t~ite9_Out732166358| |P0Thread1of1ForFork2_#t~ite8_Out732166358|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In732166358 256)))) (or (and (= 0 (mod ~x$w_buff1_used~0_In732166358 256)) .cse1) (= (mod ~x$w_buff0_used~0_In732166358 256) 0) (and (= 0 (mod ~x$r_buff1_thd1~0_In732166358 256)) .cse1))) (= |P0Thread1of1ForFork2_#t~ite8_Out732166358| ~x$w_buff0~0_In732166358) .cse0))) InVars {~x$w_buff0~0=~x$w_buff0~0_In732166358, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In732166358, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In732166358|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In732166358, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In732166358, ~weak$$choice2~0=~weak$$choice2~0_In732166358, ~x$w_buff0_used~0=~x$w_buff0_used~0_In732166358} OutVars{~x$w_buff0~0=~x$w_buff0~0_In732166358, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In732166358, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out732166358|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In732166358, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out732166358|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In732166358, ~weak$$choice2~0=~weak$$choice2~0_In732166358, ~x$w_buff0_used~0=~x$w_buff0_used~0_In732166358} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 14:41:32,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L797-->L797-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In-1680615925 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1680615925 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1680615925 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In-1680615925 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite35_Out-1680615925|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~x$w_buff1_used~0_In-1680615925 |P2Thread1of1ForFork1_#t~ite35_Out-1680615925|) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1680615925, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1680615925, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1680615925, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1680615925} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-1680615925|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1680615925, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1680615925, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1680615925, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1680615925} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 14:41:32,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In426298268 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In426298268 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out426298268|) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd3~0_In426298268 |P2Thread1of1ForFork1_#t~ite36_Out426298268|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In426298268, ~x$w_buff0_used~0=~x$w_buff0_used~0_In426298268} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out426298268|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In426298268, ~x$w_buff0_used~0=~x$w_buff0_used~0_In426298268} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 14:41:32,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L799-->L799-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In1716769271 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In1716769271 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In1716769271 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In1716769271 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite37_Out1716769271| ~x$r_buff1_thd3~0_In1716769271) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork1_#t~ite37_Out1716769271| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1716769271, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1716769271, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1716769271, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1716769271} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out1716769271|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1716769271, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1716769271, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1716769271, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1716769271} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 14:41:32,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L799-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~x$r_buff1_thd3~0_48 |v_P2Thread1of1ForFork1_#t~ite37_30|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_29|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_48, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 14:41:32,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L743-->L743-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1151078418 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite17_Out1151078418| |P0Thread1of1ForFork2_#t~ite18_Out1151078418|) (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In1151078418 256)))) (or (= (mod ~x$w_buff0_used~0_In1151078418 256) 0) (and (= (mod ~x$r_buff1_thd1~0_In1151078418 256) 0) .cse0) (and (= 0 (mod ~x$w_buff1_used~0_In1151078418 256)) .cse0))) .cse1 (= ~x$w_buff1_used~0_In1151078418 |P0Thread1of1ForFork2_#t~ite17_Out1151078418|)) (and (= |P0Thread1of1ForFork2_#t~ite17_In1151078418| |P0Thread1of1ForFork2_#t~ite17_Out1151078418|) (not .cse1) (= ~x$w_buff1_used~0_In1151078418 |P0Thread1of1ForFork2_#t~ite18_Out1151078418|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1151078418, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In1151078418|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1151078418, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1151078418, ~weak$$choice2~0=~weak$$choice2~0_In1151078418, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1151078418} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1151078418, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out1151078418|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out1151078418|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1151078418, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1151078418, ~weak$$choice2~0=~weak$$choice2~0_In1151078418, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1151078418} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 14:41:32,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_101 v_~x$r_buff0_thd1~0_100) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_101, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_11|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_100, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_39, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_9|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 14:41:32,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L745-->L745-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In908595460 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In908595460 256)))) (or (and .cse0 (= 0 (mod ~x$w_buff1_used~0_In908595460 256))) (= (mod ~x$w_buff0_used~0_In908595460 256) 0) (and (= 0 (mod ~x$r_buff1_thd1~0_In908595460 256)) .cse0))) .cse1 (= ~x$r_buff1_thd1~0_In908595460 |P0Thread1of1ForFork2_#t~ite23_Out908595460|) (= |P0Thread1of1ForFork2_#t~ite24_Out908595460| |P0Thread1of1ForFork2_#t~ite23_Out908595460|)) (and (= |P0Thread1of1ForFork2_#t~ite23_In908595460| |P0Thread1of1ForFork2_#t~ite23_Out908595460|) (= ~x$r_buff1_thd1~0_In908595460 |P0Thread1of1ForFork2_#t~ite24_Out908595460|) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In908595460, ~x$w_buff1_used~0=~x$w_buff1_used~0_In908595460, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In908595460, ~weak$$choice2~0=~weak$$choice2~0_In908595460, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In908595460|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In908595460} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In908595460, ~x$w_buff1_used~0=~x$w_buff1_used~0_In908595460, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In908595460, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out908595460|, ~weak$$choice2~0=~weak$$choice2~0_In908595460, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out908595460|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In908595460} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-18 14:41:32,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L747-->L755: Formula: (and (= v_~x$flush_delayed~0_17 0) (not (= (mod v_~x$flush_delayed~0_18 256) 0)) (= v_~x~0_34 v_~x$mem_tmp~0_10) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_18, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_10} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_15|, ~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ~x~0=v_~x~0_34} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 14:41:32,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L826-->L828-2: Formula: (and (or (= 0 (mod v_~x$w_buff0_used~0_158 256)) (= 0 (mod v_~x$r_buff0_thd0~0_26 256))) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_158} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_158} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 14:41:32,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L828-2-->L828-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In-1553849493 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-1553849493 256) 0))) (or (and (or .cse0 .cse1) (= ~x~0_In-1553849493 |ULTIMATE.start_main_#t~ite41_Out-1553849493|)) (and (= ~x$w_buff1~0_In-1553849493 |ULTIMATE.start_main_#t~ite41_Out-1553849493|) (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1553849493, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1553849493, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1553849493, ~x~0=~x~0_In-1553849493} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1553849493|, ~x$w_buff1~0=~x$w_buff1~0_In-1553849493, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1553849493, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1553849493, ~x~0=~x~0_In-1553849493} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 14:41:32,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L828-4-->L829: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite41_11|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-18 14:41:32,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L829-->L829-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In92891076 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In92891076 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In92891076 |ULTIMATE.start_main_#t~ite43_Out92891076|)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite43_Out92891076| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In92891076, ~x$w_buff0_used~0=~x$w_buff0_used~0_In92891076} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In92891076, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out92891076|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In92891076} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 14:41:32,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L830-->L830-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In885494838 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In885494838 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In885494838 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In885494838 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite44_Out885494838| ~x$w_buff1_used~0_In885494838)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite44_Out885494838| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In885494838, ~x$w_buff1_used~0=~x$w_buff1_used~0_In885494838, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In885494838, ~x$w_buff0_used~0=~x$w_buff0_used~0_In885494838} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In885494838, ~x$w_buff1_used~0=~x$w_buff1_used~0_In885494838, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In885494838, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out885494838|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In885494838} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 14:41:32,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In8020870 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In8020870 256)))) (or (and (= ~x$r_buff0_thd0~0_In8020870 |ULTIMATE.start_main_#t~ite45_Out8020870|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite45_Out8020870| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In8020870, ~x$w_buff0_used~0=~x$w_buff0_used~0_In8020870} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In8020870, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out8020870|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In8020870} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 14:41:32,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L832-->L832-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1726869056 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-1726869056 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In-1726869056 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-1726869056 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out-1726869056| ~x$r_buff1_thd0~0_In-1726869056) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite46_Out-1726869056|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1726869056, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1726869056, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1726869056, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1726869056} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1726869056, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1726869056|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1726869056, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1726869056, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1726869056} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 14:41:32,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~z~0_60 2) (= v_~main$tmp_guard1~0_25 0) (= 1 v_~__unbuffered_p2_EAX~0_35) (= v_ULTIMATE.start___VERIFIER_assert_~expression_22 0) (= v_~x$r_buff1_thd0~0_277 |v_ULTIMATE.start_main_#t~ite46_60|) (= 0 v_~__unbuffered_p0_EAX~0_54) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15| (mod v_~main$tmp_guard1~0_25 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_60|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35, ~z~0=v_~z~0_60} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_22, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_59|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35, ~z~0=v_~z~0_60, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_277, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 14:41:32,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:41:32 BasicIcfg [2019-12-18 14:41:32,742 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:41:32,745 INFO L168 Benchmark]: Toolchain (without parser) took 156193.86 ms. Allocated memory was 144.2 MB in the beginning and 3.1 GB in the end (delta: 3.0 GB). Free memory was 100.2 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 506.6 MB. Max. memory is 7.1 GB. [2019-12-18 14:41:32,745 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-18 14:41:32,746 INFO L168 Benchmark]: CACSL2BoogieTranslator took 777.18 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 99.8 MB in the beginning and 153.2 MB in the end (delta: -53.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2019-12-18 14:41:32,746 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.78 ms. Allocated memory is still 201.3 MB. Free memory was 153.2 MB in the beginning and 150.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 14:41:32,752 INFO L168 Benchmark]: Boogie Preprocessor took 37.25 ms. Allocated memory is still 201.3 MB. Free memory was 150.4 MB in the beginning and 148.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 14:41:32,752 INFO L168 Benchmark]: RCFGBuilder took 827.66 ms. Allocated memory is still 201.3 MB. Free memory was 148.3 MB in the beginning and 101.4 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. [2019-12-18 14:41:32,753 INFO L168 Benchmark]: TraceAbstraction took 154476.76 ms. Allocated memory was 201.3 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 100.7 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 450.0 MB. Max. memory is 7.1 GB. [2019-12-18 14:41:32,756 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.53 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 777.18 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 99.8 MB in the beginning and 153.2 MB in the end (delta: -53.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.78 ms. Allocated memory is still 201.3 MB. Free memory was 153.2 MB in the beginning and 150.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.25 ms. Allocated memory is still 201.3 MB. Free memory was 150.4 MB in the beginning and 148.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 827.66 ms. Allocated memory is still 201.3 MB. Free memory was 148.3 MB in the beginning and 101.4 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 154476.76 ms. Allocated memory was 201.3 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 100.7 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 450.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 163 ProgramPointsBefore, 83 ProgramPointsAfterwards, 194 TransitionsBefore, 92 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 26 ChoiceCompositions, 6709 VarBasedMoverChecksPositive, 292 VarBasedMoverChecksNegative, 116 SemBasedMoverChecksPositive, 259 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 66094 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t2076, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L820] FCALL, FORK 0 pthread_create(&t2077, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L822] FCALL, FORK 0 pthread_create(&t2078, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L789] 3 __unbuffered_p2_EAX = y [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L795] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L730] 1 z = 2 [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L796] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EAX = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L824] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L829] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 2 error locations. Result: UNSAFE, OverallTime: 154.1s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 53.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4245 SDtfs, 6612 SDslu, 11386 SDs, 0 SdLazy, 7758 SolverSat, 369 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 294 GetRequests, 41 SyntacticMatches, 15 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 975 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161868occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 78.6s AutomataMinimizationTime, 28 MinimizatonAttempts, 173691 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1017 NumberOfCodeBlocks, 1017 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 933 ConstructedInterpolants, 0 QuantifiedInterpolants, 149265 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...