/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/mix028_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 22:10:26,086 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 22:10:26,089 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 22:10:26,102 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 22:10:26,102 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 22:10:26,104 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 22:10:26,105 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 22:10:26,107 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 22:10:26,108 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 22:10:26,109 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 22:10:26,110 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 22:10:26,111 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 22:10:26,112 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 22:10:26,113 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 22:10:26,114 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 22:10:26,115 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 22:10:26,115 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 22:10:26,116 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 22:10:26,118 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 22:10:26,120 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 22:10:26,122 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 22:10:26,123 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 22:10:26,124 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 22:10:26,125 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 22:10:26,127 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 22:10:26,127 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 22:10:26,128 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 22:10:26,128 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 22:10:26,129 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 22:10:26,130 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 22:10:26,130 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 22:10:26,131 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 22:10:26,132 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 22:10:26,132 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 22:10:26,133 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 22:10:26,134 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 22:10:26,134 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 22:10:26,134 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 22:10:26,135 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 22:10:26,136 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 22:10:26,136 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 22:10:26,137 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-26 22:10:26,151 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 22:10:26,152 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 22:10:26,153 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 22:10:26,153 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 22:10:26,153 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 22:10:26,154 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 22:10:26,154 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 22:10:26,154 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 22:10:26,154 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 22:10:26,154 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 22:10:26,154 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 22:10:26,155 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 22:10:26,155 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 22:10:26,155 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 22:10:26,155 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 22:10:26,155 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 22:10:26,156 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 22:10:26,156 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 22:10:26,156 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 22:10:26,156 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 22:10:26,156 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 22:10:26,157 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:10:26,157 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 22:10:26,157 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 22:10:26,157 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 22:10:26,157 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 22:10:26,158 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 22:10:26,158 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 22:10:26,158 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 22:10:26,158 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 22:10:26,436 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 22:10:26,453 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 22:10:26,461 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 22:10:26,462 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 22:10:26,463 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 22:10:26,464 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_pso.opt.i [2019-12-26 22:10:26,536 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f535e4f92/54269359620e4b9a87b52ad5d9060c7f/FLAG68a7ee745 [2019-12-26 22:10:27,158 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 22:10:27,158 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_pso.opt.i [2019-12-26 22:10:27,173 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f535e4f92/54269359620e4b9a87b52ad5d9060c7f/FLAG68a7ee745 [2019-12-26 22:10:27,401 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f535e4f92/54269359620e4b9a87b52ad5d9060c7f [2019-12-26 22:10:27,410 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 22:10:27,412 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 22:10:27,413 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 22:10:27,413 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 22:10:27,417 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 22:10:27,418 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:10:27" (1/1) ... [2019-12-26 22:10:27,421 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d1b0b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:10:27, skipping insertion in model container [2019-12-26 22:10:27,421 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:10:27" (1/1) ... [2019-12-26 22:10:27,429 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 22:10:27,492 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 22:10:28,009 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:10:28,025 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 22:10:28,110 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:10:28,184 INFO L208 MainTranslator]: Completed translation [2019-12-26 22:10:28,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:10:28 WrapperNode [2019-12-26 22:10:28,185 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 22:10:28,186 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 22:10:28,186 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 22:10:28,186 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 22:10:28,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:10:28" (1/1) ... [2019-12-26 22:10:28,216 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:10:28" (1/1) ... [2019-12-26 22:10:28,252 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 22:10:28,252 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 22:10:28,253 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 22:10:28,253 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 22:10:28,262 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:10:28" (1/1) ... [2019-12-26 22:10:28,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:10:28" (1/1) ... [2019-12-26 22:10:28,268 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:10:28" (1/1) ... [2019-12-26 22:10:28,268 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:10:28" (1/1) ... [2019-12-26 22:10:28,279 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:10:28" (1/1) ... [2019-12-26 22:10:28,284 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:10:28" (1/1) ... [2019-12-26 22:10:28,287 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:10:28" (1/1) ... [2019-12-26 22:10:28,292 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 22:10:28,293 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 22:10:28,293 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 22:10:28,293 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 22:10:28,294 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:10:28" (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-26 22:10:28,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 22:10:28,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 22:10:28,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 22:10:28,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 22:10:28,372 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 22:10:28,372 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 22:10:28,372 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 22:10:28,372 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 22:10:28,373 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 22:10:28,373 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 22:10:28,373 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 22:10:28,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 22:10:28,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 22:10:28,375 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 22:10:29,197 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 22:10:29,197 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 22:10:29,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:10:29 BoogieIcfgContainer [2019-12-26 22:10:29,199 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 22:10:29,200 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 22:10:29,200 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 22:10:29,203 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 22:10:29,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 10:10:27" (1/3) ... [2019-12-26 22:10:29,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d489b82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:10:29, skipping insertion in model container [2019-12-26 22:10:29,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:10:28" (2/3) ... [2019-12-26 22:10:29,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d489b82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:10:29, skipping insertion in model container [2019-12-26 22:10:29,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:10:29" (3/3) ... [2019-12-26 22:10:29,207 INFO L109 eAbstractionObserver]: Analyzing ICFG mix028_pso.opt.i [2019-12-26 22:10:29,217 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 22:10:29,217 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 22:10:29,224 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 22:10:29,225 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 22:10:29,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,263 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,264 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,272 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,272 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,273 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,273 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,274 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,298 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,298 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,309 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,309 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,313 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,313 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,313 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,317 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,318 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:10:29,334 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 22:10:29,354 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 22:10:29,354 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 22:10:29,354 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 22:10:29,354 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 22:10:29,354 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 22:10:29,355 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 22:10:29,355 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 22:10:29,355 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 22:10:29,373 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-26 22:10:29,375 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-26 22:10:29,481 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-26 22:10:29,482 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:10:29,497 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 338 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 22:10:29,522 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-26 22:10:29,577 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-26 22:10:29,577 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:10:29,585 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 338 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 22:10:29,604 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-26 22:10:29,606 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 22:10:34,737 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-26 22:10:34,886 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-26 22:10:34,912 INFO L206 etLargeBlockEncoding]: Checked pairs total: 79058 [2019-12-26 22:10:34,912 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-26 22:10:34,916 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 107 transitions [2019-12-26 22:10:53,089 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115078 states. [2019-12-26 22:10:53,091 INFO L276 IsEmpty]: Start isEmpty. Operand 115078 states. [2019-12-26 22:10:53,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-26 22:10:53,097 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:10:53,098 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-26 22:10:53,099 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:10:53,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:10:53,108 INFO L82 PathProgramCache]: Analyzing trace with hash 811621075, now seen corresponding path program 1 times [2019-12-26 22:10:53,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:10:53,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155441173] [2019-12-26 22:10:53,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:10:53,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:10:53,337 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-26 22:10:53,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155441173] [2019-12-26 22:10:53,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:10:53,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:10:53,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002305961] [2019-12-26 22:10:53,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:10:53,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:10:53,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:10:53,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:10:53,363 INFO L87 Difference]: Start difference. First operand 115078 states. Second operand 3 states. [2019-12-26 22:10:54,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:10:54,764 INFO L93 Difference]: Finished difference Result 114778 states and 493920 transitions. [2019-12-26 22:10:54,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:10:54,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-26 22:10:54,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:10:55,627 INFO L225 Difference]: With dead ends: 114778 [2019-12-26 22:10:55,628 INFO L226 Difference]: Without dead ends: 112412 [2019-12-26 22:10:55,629 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-26 22:11:02,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112412 states. [2019-12-26 22:11:05,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112412 to 112412. [2019-12-26 22:11:05,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112412 states. [2019-12-26 22:11:06,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112412 states to 112412 states and 484274 transitions. [2019-12-26 22:11:06,446 INFO L78 Accepts]: Start accepts. Automaton has 112412 states and 484274 transitions. Word has length 5 [2019-12-26 22:11:06,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:06,446 INFO L462 AbstractCegarLoop]: Abstraction has 112412 states and 484274 transitions. [2019-12-26 22:11:06,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:11:06,446 INFO L276 IsEmpty]: Start isEmpty. Operand 112412 states and 484274 transitions. [2019-12-26 22:11:06,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 22:11:06,449 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:06,450 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:11:06,450 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:06,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:06,451 INFO L82 PathProgramCache]: Analyzing trace with hash -287251583, now seen corresponding path program 1 times [2019-12-26 22:11:06,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:06,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190618751] [2019-12-26 22:11:06,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:06,594 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-26 22:11:06,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190618751] [2019-12-26 22:11:06,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:06,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:11:06,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309056318] [2019-12-26 22:11:06,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:11:06,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:06,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:11:06,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:11:06,598 INFO L87 Difference]: Start difference. First operand 112412 states and 484274 transitions. Second operand 4 states. [2019-12-26 22:11:12,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:12,697 INFO L93 Difference]: Finished difference Result 180702 states and 747767 transitions. [2019-12-26 22:11:12,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:11:12,703 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 22:11:12,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:13,379 INFO L225 Difference]: With dead ends: 180702 [2019-12-26 22:11:13,379 INFO L226 Difference]: Without dead ends: 180653 [2019-12-26 22:11:13,380 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-26 22:11:21,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180653 states. [2019-12-26 22:11:25,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180653 to 165577. [2019-12-26 22:11:25,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165577 states. [2019-12-26 22:11:26,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165577 states to 165577 states and 693075 transitions. [2019-12-26 22:11:26,743 INFO L78 Accepts]: Start accepts. Automaton has 165577 states and 693075 transitions. Word has length 11 [2019-12-26 22:11:26,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:26,744 INFO L462 AbstractCegarLoop]: Abstraction has 165577 states and 693075 transitions. [2019-12-26 22:11:26,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:11:26,744 INFO L276 IsEmpty]: Start isEmpty. Operand 165577 states and 693075 transitions. [2019-12-26 22:11:26,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 22:11:26,750 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:26,750 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:11:26,751 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:26,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:26,751 INFO L82 PathProgramCache]: Analyzing trace with hash 228163746, now seen corresponding path program 1 times [2019-12-26 22:11:26,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:26,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067459754] [2019-12-26 22:11:26,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:26,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-26 22:11:26,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067459754] [2019-12-26 22:11:26,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:26,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:11:26,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121882732] [2019-12-26 22:11:26,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:11:26,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:26,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:11:26,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:11:26,840 INFO L87 Difference]: Start difference. First operand 165577 states and 693075 transitions. Second operand 4 states. [2019-12-26 22:11:28,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:28,298 INFO L93 Difference]: Finished difference Result 235681 states and 964563 transitions. [2019-12-26 22:11:28,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:11:28,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 22:11:28,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:36,557 INFO L225 Difference]: With dead ends: 235681 [2019-12-26 22:11:36,557 INFO L226 Difference]: Without dead ends: 235618 [2019-12-26 22:11:36,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:11:42,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235618 states. [2019-12-26 22:11:46,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235618 to 199613. [2019-12-26 22:11:46,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199613 states. [2019-12-26 22:11:47,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199613 states to 199613 states and 830031 transitions. [2019-12-26 22:11:47,017 INFO L78 Accepts]: Start accepts. Automaton has 199613 states and 830031 transitions. Word has length 13 [2019-12-26 22:11:47,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:47,019 INFO L462 AbstractCegarLoop]: Abstraction has 199613 states and 830031 transitions. [2019-12-26 22:11:47,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:11:47,019 INFO L276 IsEmpty]: Start isEmpty. Operand 199613 states and 830031 transitions. [2019-12-26 22:11:47,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 22:11:47,023 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:47,023 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:11:47,023 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:47,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:47,024 INFO L82 PathProgramCache]: Analyzing trace with hash 986322522, now seen corresponding path program 1 times [2019-12-26 22:11:47,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:47,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711385657] [2019-12-26 22:11:47,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:48,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:48,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:11:48,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711385657] [2019-12-26 22:11:48,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:48,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:11:48,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724831446] [2019-12-26 22:11:48,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:11:48,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:48,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:11:48,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:11:48,407 INFO L87 Difference]: Start difference. First operand 199613 states and 830031 transitions. Second operand 3 states. [2019-12-26 22:11:48,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:48,559 INFO L93 Difference]: Finished difference Result 39466 states and 128760 transitions. [2019-12-26 22:11:48,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:11:48,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 22:11:48,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:48,621 INFO L225 Difference]: With dead ends: 39466 [2019-12-26 22:11:48,621 INFO L226 Difference]: Without dead ends: 39466 [2019-12-26 22:11:48,621 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-26 22:11:48,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39466 states. [2019-12-26 22:11:49,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39466 to 39466. [2019-12-26 22:11:49,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39466 states. [2019-12-26 22:11:49,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39466 states to 39466 states and 128760 transitions. [2019-12-26 22:11:49,283 INFO L78 Accepts]: Start accepts. Automaton has 39466 states and 128760 transitions. Word has length 13 [2019-12-26 22:11:49,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:49,284 INFO L462 AbstractCegarLoop]: Abstraction has 39466 states and 128760 transitions. [2019-12-26 22:11:49,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:11:49,284 INFO L276 IsEmpty]: Start isEmpty. Operand 39466 states and 128760 transitions. [2019-12-26 22:11:49,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 22:11:49,287 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:49,287 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-26 22:11:49,288 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:49,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:49,288 INFO L82 PathProgramCache]: Analyzing trace with hash -462367392, now seen corresponding path program 1 times [2019-12-26 22:11:49,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:49,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305721677] [2019-12-26 22:11:49,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:49,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:49,450 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-26 22:11:49,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305721677] [2019-12-26 22:11:49,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:49,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:11:49,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827752194] [2019-12-26 22:11:49,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:11:49,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:49,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:11:49,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:11:49,451 INFO L87 Difference]: Start difference. First operand 39466 states and 128760 transitions. Second operand 5 states. [2019-12-26 22:11:50,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:50,200 INFO L93 Difference]: Finished difference Result 53323 states and 170492 transitions. [2019-12-26 22:11:50,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 22:11:50,200 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-26 22:11:50,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:50,287 INFO L225 Difference]: With dead ends: 53323 [2019-12-26 22:11:50,287 INFO L226 Difference]: Without dead ends: 53310 [2019-12-26 22:11:50,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:11:50,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53310 states. [2019-12-26 22:11:51,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53310 to 39837. [2019-12-26 22:11:51,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39837 states. [2019-12-26 22:11:51,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39837 states to 39837 states and 129810 transitions. [2019-12-26 22:11:51,629 INFO L78 Accepts]: Start accepts. Automaton has 39837 states and 129810 transitions. Word has length 19 [2019-12-26 22:11:51,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:51,629 INFO L462 AbstractCegarLoop]: Abstraction has 39837 states and 129810 transitions. [2019-12-26 22:11:51,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:11:51,630 INFO L276 IsEmpty]: Start isEmpty. Operand 39837 states and 129810 transitions. [2019-12-26 22:11:51,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 22:11:51,643 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:51,643 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-26 22:11:51,643 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:51,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:51,643 INFO L82 PathProgramCache]: Analyzing trace with hash 781437825, now seen corresponding path program 1 times [2019-12-26 22:11:51,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:51,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440673846] [2019-12-26 22:11:51,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:51,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:51,718 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-26 22:11:51,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440673846] [2019-12-26 22:11:51,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:51,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:11:51,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975675795] [2019-12-26 22:11:51,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:11:51,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:51,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:11:51,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:11:51,721 INFO L87 Difference]: Start difference. First operand 39837 states and 129810 transitions. Second operand 4 states. [2019-12-26 22:11:51,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:51,767 INFO L93 Difference]: Finished difference Result 7581 states and 20788 transitions. [2019-12-26 22:11:51,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:11:51,769 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 22:11:51,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:51,785 INFO L225 Difference]: With dead ends: 7581 [2019-12-26 22:11:51,786 INFO L226 Difference]: Without dead ends: 7581 [2019-12-26 22:11:51,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:11:51,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7581 states. [2019-12-26 22:11:51,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7581 to 7441. [2019-12-26 22:11:51,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7441 states. [2019-12-26 22:11:51,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7441 states to 7441 states and 20388 transitions. [2019-12-26 22:11:51,885 INFO L78 Accepts]: Start accepts. Automaton has 7441 states and 20388 transitions. Word has length 25 [2019-12-26 22:11:51,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:51,885 INFO L462 AbstractCegarLoop]: Abstraction has 7441 states and 20388 transitions. [2019-12-26 22:11:51,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:11:51,886 INFO L276 IsEmpty]: Start isEmpty. Operand 7441 states and 20388 transitions. [2019-12-26 22:11:51,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-26 22:11:51,897 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:51,897 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:11:51,897 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:51,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:51,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1015424040, now seen corresponding path program 1 times [2019-12-26 22:11:51,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:51,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496053669] [2019-12-26 22:11:51,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:51,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:51,969 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-26 22:11:51,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496053669] [2019-12-26 22:11:51,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:51,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:11:51,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121370209] [2019-12-26 22:11:51,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:11:51,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:51,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:11:51,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:11:51,971 INFO L87 Difference]: Start difference. First operand 7441 states and 20388 transitions. Second operand 5 states. [2019-12-26 22:11:52,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:52,011 INFO L93 Difference]: Finished difference Result 5402 states and 15528 transitions. [2019-12-26 22:11:52,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:11:52,012 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-26 22:11:52,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:52,019 INFO L225 Difference]: With dead ends: 5402 [2019-12-26 22:11:52,019 INFO L226 Difference]: Without dead ends: 5402 [2019-12-26 22:11:52,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:11:52,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5402 states. [2019-12-26 22:11:52,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5402 to 4989. [2019-12-26 22:11:52,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4989 states. [2019-12-26 22:11:52,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4989 states to 4989 states and 14411 transitions. [2019-12-26 22:11:52,097 INFO L78 Accepts]: Start accepts. Automaton has 4989 states and 14411 transitions. Word has length 37 [2019-12-26 22:11:52,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:52,097 INFO L462 AbstractCegarLoop]: Abstraction has 4989 states and 14411 transitions. [2019-12-26 22:11:52,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:11:52,097 INFO L276 IsEmpty]: Start isEmpty. Operand 4989 states and 14411 transitions. [2019-12-26 22:11:52,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:11:52,106 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:52,106 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:11:52,106 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:52,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:52,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1550906862, now seen corresponding path program 1 times [2019-12-26 22:11:52,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:52,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674053555] [2019-12-26 22:11:52,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:52,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:52,177 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-26 22:11:52,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674053555] [2019-12-26 22:11:52,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:52,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:11:52,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623811892] [2019-12-26 22:11:52,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:11:52,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:52,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:11:52,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:11:52,179 INFO L87 Difference]: Start difference. First operand 4989 states and 14411 transitions. Second operand 3 states. [2019-12-26 22:11:52,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:52,249 INFO L93 Difference]: Finished difference Result 4998 states and 14420 transitions. [2019-12-26 22:11:52,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:11:52,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 22:11:52,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:52,257 INFO L225 Difference]: With dead ends: 4998 [2019-12-26 22:11:52,258 INFO L226 Difference]: Without dead ends: 4998 [2019-12-26 22:11:52,258 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-26 22:11:52,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4998 states. [2019-12-26 22:11:52,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4998 to 4994. [2019-12-26 22:11:52,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4994 states. [2019-12-26 22:11:52,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4994 states to 4994 states and 14416 transitions. [2019-12-26 22:11:52,360 INFO L78 Accepts]: Start accepts. Automaton has 4994 states and 14416 transitions. Word has length 65 [2019-12-26 22:11:52,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:52,361 INFO L462 AbstractCegarLoop]: Abstraction has 4994 states and 14416 transitions. [2019-12-26 22:11:52,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:11:52,361 INFO L276 IsEmpty]: Start isEmpty. Operand 4994 states and 14416 transitions. [2019-12-26 22:11:52,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:11:52,371 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:52,371 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:11:52,371 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:52,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:52,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1256158932, now seen corresponding path program 1 times [2019-12-26 22:11:52,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:52,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432232876] [2019-12-26 22:11:52,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:52,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:52,479 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-26 22:11:52,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432232876] [2019-12-26 22:11:52,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:52,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:11:52,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904870876] [2019-12-26 22:11:52,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:11:52,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:52,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:11:52,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:11:52,482 INFO L87 Difference]: Start difference. First operand 4994 states and 14416 transitions. Second operand 3 states. [2019-12-26 22:11:52,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:52,510 INFO L93 Difference]: Finished difference Result 4994 states and 14195 transitions. [2019-12-26 22:11:52,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:11:52,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 22:11:52,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:52,518 INFO L225 Difference]: With dead ends: 4994 [2019-12-26 22:11:52,518 INFO L226 Difference]: Without dead ends: 4994 [2019-12-26 22:11:52,518 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-26 22:11:52,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4994 states. [2019-12-26 22:11:52,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4994 to 4994. [2019-12-26 22:11:52,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4994 states. [2019-12-26 22:11:52,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4994 states to 4994 states and 14195 transitions. [2019-12-26 22:11:52,595 INFO L78 Accepts]: Start accepts. Automaton has 4994 states and 14195 transitions. Word has length 65 [2019-12-26 22:11:52,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:52,595 INFO L462 AbstractCegarLoop]: Abstraction has 4994 states and 14195 transitions. [2019-12-26 22:11:52,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:11:52,595 INFO L276 IsEmpty]: Start isEmpty. Operand 4994 states and 14195 transitions. [2019-12-26 22:11:52,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:11:52,602 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:52,602 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:11:52,603 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:52,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:52,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1760720695, now seen corresponding path program 1 times [2019-12-26 22:11:52,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:52,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452644123] [2019-12-26 22:11:52,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:52,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:52,712 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-26 22:11:52,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452644123] [2019-12-26 22:11:52,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:52,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:11:52,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254279459] [2019-12-26 22:11:52,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:11:52,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:52,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:11:52,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:11:52,716 INFO L87 Difference]: Start difference. First operand 4994 states and 14195 transitions. Second operand 5 states. [2019-12-26 22:11:53,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:53,021 INFO L93 Difference]: Finished difference Result 7330 states and 20675 transitions. [2019-12-26 22:11:53,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:11:53,021 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-26 22:11:53,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:53,032 INFO L225 Difference]: With dead ends: 7330 [2019-12-26 22:11:53,033 INFO L226 Difference]: Without dead ends: 7330 [2019-12-26 22:11:53,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-26 22:11:53,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7330 states. [2019-12-26 22:11:53,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7330 to 6065. [2019-12-26 22:11:53,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6065 states. [2019-12-26 22:11:53,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6065 states to 6065 states and 17257 transitions. [2019-12-26 22:11:53,132 INFO L78 Accepts]: Start accepts. Automaton has 6065 states and 17257 transitions. Word has length 66 [2019-12-26 22:11:53,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:53,132 INFO L462 AbstractCegarLoop]: Abstraction has 6065 states and 17257 transitions. [2019-12-26 22:11:53,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:11:53,132 INFO L276 IsEmpty]: Start isEmpty. Operand 6065 states and 17257 transitions. [2019-12-26 22:11:53,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:11:53,141 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:53,141 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:11:53,141 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:53,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:53,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1764113003, now seen corresponding path program 2 times [2019-12-26 22:11:53,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:53,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94317239] [2019-12-26 22:11:53,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:53,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:53,247 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-26 22:11:53,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94317239] [2019-12-26 22:11:53,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:53,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:11:53,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832599967] [2019-12-26 22:11:53,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:11:53,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:53,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:11:53,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:11:53,250 INFO L87 Difference]: Start difference. First operand 6065 states and 17257 transitions. Second operand 5 states. [2019-12-26 22:11:53,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:53,800 INFO L93 Difference]: Finished difference Result 8773 states and 24705 transitions. [2019-12-26 22:11:53,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 22:11:53,800 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-26 22:11:53,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:53,813 INFO L225 Difference]: With dead ends: 8773 [2019-12-26 22:11:53,813 INFO L226 Difference]: Without dead ends: 8773 [2019-12-26 22:11:53,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:11:53,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8773 states. [2019-12-26 22:11:53,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8773 to 6413. [2019-12-26 22:11:53,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6413 states. [2019-12-26 22:11:53,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6413 states to 6413 states and 18290 transitions. [2019-12-26 22:11:53,958 INFO L78 Accepts]: Start accepts. Automaton has 6413 states and 18290 transitions. Word has length 66 [2019-12-26 22:11:53,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:53,958 INFO L462 AbstractCegarLoop]: Abstraction has 6413 states and 18290 transitions. [2019-12-26 22:11:53,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:11:53,958 INFO L276 IsEmpty]: Start isEmpty. Operand 6413 states and 18290 transitions. [2019-12-26 22:11:53,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:11:53,967 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:53,967 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:11:53,967 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:53,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:53,967 INFO L82 PathProgramCache]: Analyzing trace with hash 956425645, now seen corresponding path program 3 times [2019-12-26 22:11:53,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:53,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387747688] [2019-12-26 22:11:53,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:53,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:54,077 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-26 22:11:54,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387747688] [2019-12-26 22:11:54,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:54,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:11:54,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044733728] [2019-12-26 22:11:54,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:11:54,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:54,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:11:54,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:11:54,079 INFO L87 Difference]: Start difference. First operand 6413 states and 18290 transitions. Second operand 6 states. [2019-12-26 22:11:54,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:54,503 INFO L93 Difference]: Finished difference Result 8691 states and 24471 transitions. [2019-12-26 22:11:54,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 22:11:54,504 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-26 22:11:54,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:54,518 INFO L225 Difference]: With dead ends: 8691 [2019-12-26 22:11:54,519 INFO L226 Difference]: Without dead ends: 8691 [2019-12-26 22:11:54,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:11:54,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8691 states. [2019-12-26 22:11:54,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8691 to 6840. [2019-12-26 22:11:54,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6840 states. [2019-12-26 22:11:54,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6840 states to 6840 states and 19489 transitions. [2019-12-26 22:11:54,656 INFO L78 Accepts]: Start accepts. Automaton has 6840 states and 19489 transitions. Word has length 66 [2019-12-26 22:11:54,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:54,657 INFO L462 AbstractCegarLoop]: Abstraction has 6840 states and 19489 transitions. [2019-12-26 22:11:54,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:11:54,657 INFO L276 IsEmpty]: Start isEmpty. Operand 6840 states and 19489 transitions. [2019-12-26 22:11:54,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:11:54,667 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:54,667 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:11:54,668 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:54,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:54,668 INFO L82 PathProgramCache]: Analyzing trace with hash 426723893, now seen corresponding path program 4 times [2019-12-26 22:11:54,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:54,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098928703] [2019-12-26 22:11:54,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:54,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:54,767 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-26 22:11:54,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098928703] [2019-12-26 22:11:54,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:54,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:11:54,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84485487] [2019-12-26 22:11:54,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:11:54,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:54,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:11:54,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:11:54,769 INFO L87 Difference]: Start difference. First operand 6840 states and 19489 transitions. Second operand 3 states. [2019-12-26 22:11:54,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:54,825 INFO L93 Difference]: Finished difference Result 6840 states and 19488 transitions. [2019-12-26 22:11:54,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:11:54,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-26 22:11:54,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:54,835 INFO L225 Difference]: With dead ends: 6840 [2019-12-26 22:11:54,835 INFO L226 Difference]: Without dead ends: 6840 [2019-12-26 22:11:54,836 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-26 22:11:54,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6840 states. [2019-12-26 22:11:54,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6840 to 4178. [2019-12-26 22:11:54,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4178 states. [2019-12-26 22:11:54,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4178 states to 4178 states and 12093 transitions. [2019-12-26 22:11:54,914 INFO L78 Accepts]: Start accepts. Automaton has 4178 states and 12093 transitions. Word has length 66 [2019-12-26 22:11:54,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:54,914 INFO L462 AbstractCegarLoop]: Abstraction has 4178 states and 12093 transitions. [2019-12-26 22:11:54,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:11:54,914 INFO L276 IsEmpty]: Start isEmpty. Operand 4178 states and 12093 transitions. [2019-12-26 22:11:54,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 22:11:54,920 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:54,920 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:11:54,920 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:54,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:54,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1488093963, now seen corresponding path program 1 times [2019-12-26 22:11:54,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:54,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013700035] [2019-12-26 22:11:54,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:54,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:55,007 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-26 22:11:55,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013700035] [2019-12-26 22:11:55,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:55,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:11:55,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098991992] [2019-12-26 22:11:55,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:11:55,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:55,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:11:55,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:11:55,009 INFO L87 Difference]: Start difference. First operand 4178 states and 12093 transitions. Second operand 3 states. [2019-12-26 22:11:55,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:55,032 INFO L93 Difference]: Finished difference Result 3871 states and 10957 transitions. [2019-12-26 22:11:55,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:11:55,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-26 22:11:55,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:55,038 INFO L225 Difference]: With dead ends: 3871 [2019-12-26 22:11:55,038 INFO L226 Difference]: Without dead ends: 3871 [2019-12-26 22:11:55,040 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-26 22:11:55,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3871 states. [2019-12-26 22:11:55,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3871 to 3183. [2019-12-26 22:11:55,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3183 states. [2019-12-26 22:11:55,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3183 states to 3183 states and 9013 transitions. [2019-12-26 22:11:55,094 INFO L78 Accepts]: Start accepts. Automaton has 3183 states and 9013 transitions. Word has length 67 [2019-12-26 22:11:55,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:55,094 INFO L462 AbstractCegarLoop]: Abstraction has 3183 states and 9013 transitions. [2019-12-26 22:11:55,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:11:55,094 INFO L276 IsEmpty]: Start isEmpty. Operand 3183 states and 9013 transitions. [2019-12-26 22:11:55,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 22:11:55,098 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:55,098 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:11:55,098 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:55,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:55,099 INFO L82 PathProgramCache]: Analyzing trace with hash -2084050195, now seen corresponding path program 1 times [2019-12-26 22:11:55,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:55,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801548048] [2019-12-26 22:11:55,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:55,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:55,249 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-26 22:11:55,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801548048] [2019-12-26 22:11:55,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:55,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:11:55,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241950297] [2019-12-26 22:11:55,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:11:55,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:55,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:11:55,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:11:55,251 INFO L87 Difference]: Start difference. First operand 3183 states and 9013 transitions. Second operand 7 states. [2019-12-26 22:11:55,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:55,399 INFO L93 Difference]: Finished difference Result 6802 states and 19408 transitions. [2019-12-26 22:11:55,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 22:11:55,399 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-12-26 22:11:55,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:55,405 INFO L225 Difference]: With dead ends: 6802 [2019-12-26 22:11:55,405 INFO L226 Difference]: Without dead ends: 3670 [2019-12-26 22:11:55,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:11:55,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3670 states. [2019-12-26 22:11:55,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3670 to 2607. [2019-12-26 22:11:55,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2607 states. [2019-12-26 22:11:55,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2607 states to 2607 states and 7312 transitions. [2019-12-26 22:11:55,449 INFO L78 Accepts]: Start accepts. Automaton has 2607 states and 7312 transitions. Word has length 68 [2019-12-26 22:11:55,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:55,450 INFO L462 AbstractCegarLoop]: Abstraction has 2607 states and 7312 transitions. [2019-12-26 22:11:55,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:11:55,450 INFO L276 IsEmpty]: Start isEmpty. Operand 2607 states and 7312 transitions. [2019-12-26 22:11:55,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 22:11:55,454 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:55,454 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:11:55,454 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:55,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:55,455 INFO L82 PathProgramCache]: Analyzing trace with hash -293308025, now seen corresponding path program 2 times [2019-12-26 22:11:55,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:55,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131822567] [2019-12-26 22:11:55,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:55,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:55,559 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-26 22:11:55,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131822567] [2019-12-26 22:11:55,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:55,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:11:55,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523097604] [2019-12-26 22:11:55,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:11:55,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:55,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:11:55,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:11:55,561 INFO L87 Difference]: Start difference. First operand 2607 states and 7312 transitions. Second operand 5 states. [2019-12-26 22:11:55,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:55,620 INFO L93 Difference]: Finished difference Result 4523 states and 12685 transitions. [2019-12-26 22:11:55,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:11:55,620 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-12-26 22:11:55,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:55,623 INFO L225 Difference]: With dead ends: 4523 [2019-12-26 22:11:55,623 INFO L226 Difference]: Without dead ends: 1963 [2019-12-26 22:11:55,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:11:55,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1963 states. [2019-12-26 22:11:55,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1963 to 1963. [2019-12-26 22:11:55,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1963 states. [2019-12-26 22:11:55,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1963 states to 1963 states and 5460 transitions. [2019-12-26 22:11:55,667 INFO L78 Accepts]: Start accepts. Automaton has 1963 states and 5460 transitions. Word has length 68 [2019-12-26 22:11:55,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:55,667 INFO L462 AbstractCegarLoop]: Abstraction has 1963 states and 5460 transitions. [2019-12-26 22:11:55,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:11:55,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 5460 transitions. [2019-12-26 22:11:55,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 22:11:55,671 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:55,672 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:11:55,672 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:55,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:55,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1266757317, now seen corresponding path program 3 times [2019-12-26 22:11:55,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:55,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802622699] [2019-12-26 22:11:55,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:55,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:11:55,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:11:55,807 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 22:11:55,808 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 22:11:55,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_57| 0 0))) (and (= 0 v_~__unbuffered_p2_EAX~0_23) (= v_~z~0_18 0) (= 0 v_~weak$$choice0~0_14) (= v_~x$flush_delayed~0_41 0) (= |v_#valid_55| (store .cse0 |v_ULTIMATE.start_main_~#t754~0.base_20| 1)) (= 0 v_~x$r_buff0_thd3~0_99) (= 0 |v_ULTIMATE.start_main_~#t754~0.offset_17|) (= v_~x$r_buff1_thd1~0_192 0) (= 0 v_~x$w_buff0~0_203) (= v_~weak$$choice2~0_116 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~x$r_buff1_thd3~0_193) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$w_buff1~0_195) (= v_~x$mem_tmp~0_22 0) (= v_~__unbuffered_p2_EBX~0_23 0) (= 0 v_~x$r_buff0_thd2~0_205) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t754~0.base_20|)) (= v_~main$tmp_guard1~0_28 0) (= v_~x$r_buff0_thd0~0_335 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t754~0.base_20|) (= 0 v_~x$read_delayed~0_7) (= v_~x$r_buff1_thd0~0_279 0) (= 0 v_~x$w_buff1_used~0_401) (= v_~__unbuffered_cnt~0_145 0) (= 0 v_~x$r_buff1_thd2~0_186) (= 0 v_~x$w_buff0_used~0_743) (= |v_#NULL.offset_5| 0) (= 0 v_~x~0_213) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t754~0.base_20| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t754~0.base_20|) |v_ULTIMATE.start_main_~#t754~0.offset_17| 0)) |v_#memory_int_23|) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t754~0.base_20| 4)) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~main$tmp_guard0~0_22 0) (= 0 v_~x$r_buff0_thd1~0_88) (= 0 |v_#NULL.base_5|) (= v_~y~0_136 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_21|, ~x$w_buff0~0=v_~x$w_buff0~0_203, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_27|, ~x$flush_delayed~0=v_~x$flush_delayed~0_41, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_31|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_25|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_40|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_192, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_99, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_39|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_25|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_46|, ULTIMATE.start_main_~#t754~0.offset=|v_ULTIMATE.start_main_~#t754~0.offset_17|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_36|, ULTIMATE.start_main_~#t754~0.base=|v_ULTIMATE.start_main_~#t754~0.base_20|, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_335, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_23, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_43|, ~x$w_buff1~0=v_~x$w_buff1~0_195, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_46|, ULTIMATE.start_main_~#t756~0.offset=|v_ULTIMATE.start_main_~#t756~0.offset_17|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_401, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_186, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_50|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_111|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_156|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_145, ~x~0=v_~x~0_213, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_88, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_21|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_33|, ULTIMATE.start_main_~#t755~0.offset=|v_ULTIMATE.start_main_~#t755~0.offset_17|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_27|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_25|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_193, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_33|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_17|, ~x$mem_tmp~0=v_~x$mem_tmp~0_22, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_273|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_41|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_34|, ~y~0=v_~y~0_136, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_23|, ULTIMATE.start_main_~#t756~0.base=|v_ULTIMATE.start_main_~#t756~0.base_21|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_27|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_54|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_279, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_205, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_59|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_42|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_743, ULTIMATE.start_main_~#t755~0.base=|v_ULTIMATE.start_main_~#t755~0.base_21|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_162|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_18, ~weak$$choice2~0=v_~weak$$choice2~0_116, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_~#t754~0.offset, ULTIMATE.start_main_#t~ite52, ULTIMATE.start_main_~#t754~0.base, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t756~0.offset, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_~#t755~0.offset, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~y~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_~#t756~0.base, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_~#t755~0.base, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-26 22:11:55,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [809] [809] L810-1-->L812: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t755~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t755~0.base_13|) |v_ULTIMATE.start_main_~#t755~0.offset_11| 1)) |v_#memory_int_15|) (not (= 0 |v_ULTIMATE.start_main_~#t755~0.base_13|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t755~0.base_13| 4) |v_#length_17|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t755~0.base_13|) (= |v_ULTIMATE.start_main_~#t755~0.offset_11| 0) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t755~0.base_13|)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t755~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t755~0.base=|v_ULTIMATE.start_main_~#t755~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, ULTIMATE.start_main_~#t755~0.offset=|v_ULTIMATE.start_main_~#t755~0.offset_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t755~0.base, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t755~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-26 22:11:55,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L812-1-->L814: Formula: (and (= |v_ULTIMATE.start_main_~#t756~0.offset_11| 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t756~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t756~0.base_13|) |v_ULTIMATE.start_main_~#t756~0.offset_11| 2)) |v_#memory_int_13|) (not (= |v_ULTIMATE.start_main_~#t756~0.base_13| 0)) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t756~0.base_13|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t756~0.base_13|) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t756~0.base_13| 1) |v_#valid_34|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t756~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t756~0.base=|v_ULTIMATE.start_main_~#t756~0.base_13|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t756~0.offset=|v_ULTIMATE.start_main_~#t756~0.offset_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t756~0.base, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, ULTIMATE.start_main_~#t756~0.offset, #length] because there is no mapped edge [2019-12-26 22:11:55,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] P1ENTRY-->L4-3: Formula: (and (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_12 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_10|) (= (mod v_~x$w_buff1_used~0_145 256) 0) (= v_~x$w_buff0~0_44 v_~x$w_buff1~0_51) (= 2 v_~x$w_buff0~0_43) (= 1 v_~x$w_buff0_used~0_300) (= |v_P1Thread1of1ForFork1_#in~arg.offset_10| v_P1Thread1of1ForFork1_~arg.offset_10) (= v_P1Thread1of1ForFork1_~arg.base_10 |v_P1Thread1of1ForFork1_#in~arg.base_10|) (= 1 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_10|) (= v_~x$w_buff0_used~0_301 v_~x$w_buff1_used~0_145)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_10|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_10|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_12, ~x$w_buff0~0=v_~x$w_buff0~0_43, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_10, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_10|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_10, ~x$w_buff1~0=v_~x$w_buff1~0_51, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_10|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_10|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_145, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_300} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-26 22:11:55,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L787-2-->L787-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-960314389 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-960314389 256)))) (or (and (not .cse0) (= ~x$w_buff1~0_In-960314389 |P2Thread1of1ForFork2_#t~ite15_Out-960314389|) (not .cse1)) (and (= ~x~0_In-960314389 |P2Thread1of1ForFork2_#t~ite15_Out-960314389|) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-960314389, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-960314389, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-960314389, ~x~0=~x~0_In-960314389} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-960314389|, ~x$w_buff1~0=~x$w_buff1~0_In-960314389, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-960314389, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-960314389, ~x~0=~x~0_In-960314389} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-26 22:11:55,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L787-4-->L788: Formula: (= v_~x~0_30 |v_P2Thread1of1ForFork2_#t~ite15_12|) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_12|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_11|, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_9|, ~x~0=v_~x~0_30} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite16, ~x~0] because there is no mapped edge [2019-12-26 22:11:55,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L735-2-->L735-5: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In2108251456 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In2108251456 256) 0)) (.cse1 (= |P0Thread1of1ForFork0_#t~ite4_Out2108251456| |P0Thread1of1ForFork0_#t~ite3_Out2108251456|))) (or (and (not .cse0) (= ~x$w_buff1~0_In2108251456 |P0Thread1of1ForFork0_#t~ite3_Out2108251456|) .cse1 (not .cse2)) (and (or .cse2 .cse0) .cse1 (= ~x~0_In2108251456 |P0Thread1of1ForFork0_#t~ite3_Out2108251456|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In2108251456, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2108251456, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2108251456, ~x~0=~x~0_In2108251456} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out2108251456|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out2108251456|, ~x$w_buff1~0=~x$w_buff1~0_In2108251456, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2108251456, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2108251456, ~x~0=~x~0_In2108251456} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-26 22:11:55,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L736-->L736-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In1011215136 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1011215136 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out1011215136| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1011215136 |P0Thread1of1ForFork0_#t~ite5_Out1011215136|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1011215136, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1011215136} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1011215136|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1011215136, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1011215136} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 22:11:55,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L788-->L788-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1628468268 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-1628468268 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite17_Out-1628468268| ~x$w_buff0_used~0_In-1628468268)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite17_Out-1628468268|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1628468268, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1628468268} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1628468268, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-1628468268|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1628468268} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-26 22:11:55,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L789-->L789-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In1084524133 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In1084524133 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In1084524133 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In1084524133 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite18_Out1084524133| ~x$w_buff1_used~0_In1084524133) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite18_Out1084524133| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1084524133, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1084524133, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1084524133, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1084524133} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1084524133, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1084524133, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1084524133, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out1084524133|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1084524133} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-26 22:11:55,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L737-->L737-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In2023794242 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In2023794242 256))) (.cse2 (= (mod ~x$r_buff0_thd1~0_In2023794242 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In2023794242 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out2023794242| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out2023794242| ~x$w_buff1_used~0_In2023794242)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2023794242, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2023794242, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2023794242, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2023794242} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out2023794242|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2023794242, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2023794242, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2023794242, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2023794242} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 22:11:55,823 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L790-->L790-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In-818925099 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-818925099 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite19_Out-818925099| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite19_Out-818925099| ~x$r_buff0_thd3~0_In-818925099)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-818925099, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-818925099} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-818925099, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-818925099|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-818925099} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-26 22:11:55,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L791-->L791-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In2050853717 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In2050853717 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In2050853717 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In2050853717 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite20_Out2050853717| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P2Thread1of1ForFork2_#t~ite20_Out2050853717| ~x$r_buff1_thd3~0_In2050853717)))) InVars {~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2050853717, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2050853717, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2050853717, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2050853717} OutVars{P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out2050853717|, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2050853717, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2050853717, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2050853717, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2050853717} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-26 22:11:55,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L791-2-->P2EXIT: Formula: (and (= v_~x$r_buff1_thd3~0_48 |v_P2Thread1of1ForFork2_#t~ite20_28|) (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_27|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_48, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-26 22:11:55,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L765-->L765-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-295284655 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-295284655 256) 0))) (or (and (= ~x$w_buff0_used~0_In-295284655 |P1Thread1of1ForFork1_#t~ite11_Out-295284655|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-295284655|) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-295284655, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-295284655} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-295284655|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-295284655, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-295284655} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-26 22:11:55,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L766-->L766-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-928311897 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-928311897 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-928311897 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-928311897 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-928311897|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-928311897 |P1Thread1of1ForFork1_#t~ite12_Out-928311897|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-928311897, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-928311897, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-928311897, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-928311897} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-928311897, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-928311897, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-928311897|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-928311897, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-928311897} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-26 22:11:55,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L767-->L768: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1463934898 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1463934898 256) 0))) (or (and (not .cse0) (= ~x$r_buff0_thd2~0_Out1463934898 0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd2~0_In1463934898 ~x$r_buff0_thd2~0_Out1463934898)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1463934898, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1463934898} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1463934898|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1463934898, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1463934898} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-26 22:11:55,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L768-->L768-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In1335114517 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1335114517 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In1335114517 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In1335114517 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out1335114517|)) (and (= |P1Thread1of1ForFork1_#t~ite14_Out1335114517| ~x$r_buff1_thd2~0_In1335114517) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1335114517, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1335114517, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1335114517, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1335114517} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1335114517, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1335114517, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1335114517, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1335114517|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1335114517} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-26 22:11:55,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L768-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_68 |v_P1Thread1of1ForFork1_#t~ite14_42|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_75 1) v_~__unbuffered_cnt~0_74) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_42|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_68, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_41|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-26 22:11:55,828 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L738-->L738-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1689506231 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In-1689506231 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out-1689506231|)) (and (= ~x$r_buff0_thd1~0_In-1689506231 |P0Thread1of1ForFork0_#t~ite7_Out-1689506231|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1689506231, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1689506231} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1689506231, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1689506231|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1689506231} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-26 22:11:55,828 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L739-->L739-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In1767320886 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1767320886 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In1767320886 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In1767320886 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out1767320886| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite8_Out1767320886| ~x$r_buff1_thd1~0_In1767320886) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1767320886, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1767320886, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1767320886, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1767320886} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1767320886, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1767320886|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1767320886, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1767320886, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1767320886} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 22:11:55,829 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L739-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_40 |v_P0Thread1of1ForFork0_#t~ite8_20|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_28 1) v_~__unbuffered_cnt~0_27) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_19|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_40} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-26 22:11:55,829 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L814-1-->L820: Formula: (and (= 3 v_~__unbuffered_cnt~0_13) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 22:11:55,830 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L820-2-->L820-5: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In277034492 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite25_Out277034492| |ULTIMATE.start_main_#t~ite24_Out277034492|)) (.cse2 (= (mod ~x$w_buff1_used~0_In277034492 256) 0))) (or (and (= ~x~0_In277034492 |ULTIMATE.start_main_#t~ite24_Out277034492|) .cse0 (or .cse1 .cse2)) (and (not .cse1) .cse0 (not .cse2) (= |ULTIMATE.start_main_#t~ite24_Out277034492| ~x$w_buff1~0_In277034492)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In277034492, ~x$w_buff1_used~0=~x$w_buff1_used~0_In277034492, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In277034492, ~x~0=~x~0_In277034492} OutVars{~x$w_buff1~0=~x$w_buff1~0_In277034492, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out277034492|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out277034492|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In277034492, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In277034492, ~x~0=~x~0_In277034492} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-26 22:11:55,830 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In2043379882 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In2043379882 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite26_Out2043379882|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In2043379882 |ULTIMATE.start_main_#t~ite26_Out2043379882|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2043379882, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2043379882} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2043379882, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out2043379882|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2043379882} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-26 22:11:55,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L822-->L822-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In-1362517174 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In-1362517174 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1362517174 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1362517174 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite27_Out-1362517174| 0)) (and (= ~x$w_buff1_used~0_In-1362517174 |ULTIMATE.start_main_#t~ite27_Out-1362517174|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1362517174, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1362517174, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1362517174, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1362517174} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1362517174, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1362517174, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-1362517174|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1362517174, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1362517174} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-26 22:11:55,832 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1487586738 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1487586738 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In-1487586738 |ULTIMATE.start_main_#t~ite28_Out-1487586738|)) (and (= 0 |ULTIMATE.start_main_#t~ite28_Out-1487586738|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1487586738, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1487586738} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1487586738, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-1487586738|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1487586738} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-26 22:11:55,833 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L824-->L824-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd0~0_In-1221286460 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1221286460 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-1221286460 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-1221286460 256) 0))) (or (and (= ~x$r_buff1_thd0~0_In-1221286460 |ULTIMATE.start_main_#t~ite29_Out-1221286460|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite29_Out-1221286460|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1221286460, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1221286460, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1221286460, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1221286460} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1221286460, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-1221286460|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1221286460, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1221286460, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1221286460} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-26 22:11:55,839 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L836-->L837: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~x$r_buff0_thd0~0_87 v_~x$r_buff0_thd0~0_86)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_87, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_86, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_7|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~weak$$choice2~0=v_~weak$$choice2~0_27} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-26 22:11:55,841 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L839-->L4: Formula: (and (= v_~x$flush_delayed~0_24 0) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (not (= (mod v_~x$flush_delayed~0_25 256) 0)) (= v_~x$mem_tmp~0_15 v_~x~0_173)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x$mem_tmp~0=v_~x$mem_tmp~0_15} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_18|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ~x$flush_delayed~0=v_~x$flush_delayed~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x$mem_tmp~0=v_~x$mem_tmp~0_15, ~x~0=v_~x~0_173, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 22:11:55,841 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-26 22:11:56,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 10:11:56 BasicIcfg [2019-12-26 22:11:56,006 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 22:11:56,008 INFO L168 Benchmark]: Toolchain (without parser) took 88597.02 ms. Allocated memory was 145.2 MB in the beginning and 3.9 GB in the end (delta: 3.8 GB). Free memory was 100.2 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-12-26 22:11:56,009 INFO L168 Benchmark]: CDTParser took 1.73 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-26 22:11:56,010 INFO L168 Benchmark]: CACSL2BoogieTranslator took 772.36 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 99.8 MB in the beginning and 155.0 MB in the end (delta: -55.2 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-26 22:11:56,011 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.40 ms. Allocated memory is still 202.4 MB. Free memory was 155.0 MB in the beginning and 151.6 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-26 22:11:56,011 INFO L168 Benchmark]: Boogie Preprocessor took 40.38 ms. Allocated memory is still 202.4 MB. Free memory was 151.6 MB in the beginning and 149.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-26 22:11:56,012 INFO L168 Benchmark]: RCFGBuilder took 905.62 ms. Allocated memory is still 202.4 MB. Free memory was 149.6 MB in the beginning and 99.1 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. [2019-12-26 22:11:56,013 INFO L168 Benchmark]: TraceAbstraction took 86806.34 ms. Allocated memory was 202.4 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 99.1 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-26 22:11:56,017 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.73 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 772.36 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 99.8 MB in the beginning and 155.0 MB in the end (delta: -55.2 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.40 ms. Allocated memory is still 202.4 MB. Free memory was 155.0 MB in the beginning and 151.6 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.38 ms. Allocated memory is still 202.4 MB. Free memory was 151.6 MB in the beginning and 149.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 905.62 ms. Allocated memory is still 202.4 MB. Free memory was 149.6 MB in the beginning and 99.1 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 86806.34 ms. Allocated memory was 202.4 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 99.1 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 175 ProgramPointsBefore, 95 ProgramPointsAfterwards, 212 TransitionsBefore, 107 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 29 ChoiceCompositions, 5405 VarBasedMoverChecksPositive, 232 VarBasedMoverChecksNegative, 72 SemBasedMoverChecksPositive, 228 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 79058 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t754, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L812] FCALL, FORK 0 pthread_create(&t755, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L814] FCALL, FORK 0 pthread_create(&t756, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L754] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L755] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L756] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L757] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L758] 2 x$r_buff0_thd2 = (_Bool)1 [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L778] 3 y = 2 [L781] 3 __unbuffered_p2_EAX = y [L784] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L729] 1 z = 1 [L732] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L787] 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_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L735] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L735] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L788] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L736] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L737] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L789] 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 [L790] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L764] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L764] 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) [L765] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L766] 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 [L738] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L820] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L820] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L821] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L822] 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 [L823] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L824] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L827] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L828] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L829] 0 x$flush_delayed = weak$$choice2 [L830] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, 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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L831] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, 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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L831] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L832] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, 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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L832] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L833] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, 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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L833] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L834] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, 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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L834] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L835] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, 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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L835] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, 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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L837] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, 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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 86.4s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 21.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2367 SDtfs, 1695 SDslu, 3717 SDs, 0 SdLazy, 1832 SolverSat, 81 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 26 SyntacticMatches, 13 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=199613occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 37.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 75000 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 788 NumberOfCodeBlocks, 788 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 704 ConstructedInterpolants, 0 QuantifiedInterpolants, 97696 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...