/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/rfi007_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:18:09,283 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:18:09,286 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:18:09,305 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:18:09,305 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:18:09,307 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:18:09,309 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:18:09,319 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:18:09,323 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:18:09,326 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:18:09,328 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:18:09,329 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:18:09,330 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:18:09,332 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:18:09,334 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:18:09,335 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:18:09,337 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:18:09,337 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:18:09,339 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:18:09,344 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:18:09,348 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:18:09,352 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:18:09,353 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:18:09,354 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:18:09,356 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:18:09,356 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:18:09,357 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:18:09,358 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:18:09,359 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:18:09,360 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:18:09,361 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:18:09,361 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:18:09,362 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:18:09,363 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:18:09,364 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:18:09,365 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:18:09,365 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:18:09,365 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:18:09,366 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:18:09,366 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:18:09,368 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:18:09,368 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 23:18:09,402 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:18:09,402 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:18:09,403 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:18:09,404 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:18:09,404 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:18:09,404 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:18:09,404 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:18:09,405 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:18:09,405 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:18:09,405 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:18:09,405 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:18:09,405 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:18:09,405 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:18:09,406 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:18:09,406 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:18:09,406 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:18:09,406 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:18:09,406 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:18:09,407 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:18:09,407 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:18:09,407 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:18:09,407 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:18:09,407 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:18:09,408 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:18:09,408 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:18:09,408 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:18:09,408 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:18:09,408 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:18:09,408 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:18:09,409 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:18:09,678 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:18:09,691 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:18:09,695 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:18:09,697 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:18:09,697 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:18:09,698 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi007_power.opt.i [2019-12-26 23:18:09,761 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9f149937/fd5c5b7392ff4f5d9807d6769db9f095/FLAG2b77b0105 [2019-12-26 23:18:10,323 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:18:10,324 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi007_power.opt.i [2019-12-26 23:18:10,347 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9f149937/fd5c5b7392ff4f5d9807d6769db9f095/FLAG2b77b0105 [2019-12-26 23:18:10,587 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9f149937/fd5c5b7392ff4f5d9807d6769db9f095 [2019-12-26 23:18:10,597 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:18:10,599 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:18:10,600 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:18:10,600 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:18:10,604 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:18:10,605 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:18:10" (1/1) ... [2019-12-26 23:18:10,608 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e5b031d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:18:10, skipping insertion in model container [2019-12-26 23:18:10,608 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:18:10" (1/1) ... [2019-12-26 23:18:10,616 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:18:10,675 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:18:11,251 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:18:11,262 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:18:11,322 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:18:11,397 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:18:11,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:18:11 WrapperNode [2019-12-26 23:18:11,397 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:18:11,398 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:18:11,398 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:18:11,398 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:18:11,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:18:11" (1/1) ... [2019-12-26 23:18:11,437 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:18:11" (1/1) ... [2019-12-26 23:18:11,481 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:18:11,481 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:18:11,481 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:18:11,482 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:18:11,491 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:18:11" (1/1) ... [2019-12-26 23:18:11,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:18:11" (1/1) ... [2019-12-26 23:18:11,495 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:18:11" (1/1) ... [2019-12-26 23:18:11,496 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:18:11" (1/1) ... [2019-12-26 23:18:11,505 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:18:11" (1/1) ... [2019-12-26 23:18:11,510 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:18:11" (1/1) ... [2019-12-26 23:18:11,513 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:18:11" (1/1) ... [2019-12-26 23:18:11,518 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:18:11,519 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:18:11,519 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:18:11,519 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:18:11,520 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:18:11" (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 23:18:11,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:18:11,595 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:18:11,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:18:11,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:18:11,596 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:18:11,596 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:18:11,596 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:18:11,596 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:18:11,596 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:18:11,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:18:11,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:18:11,598 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 23:18:12,322 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:18:12,323 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:18:12,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:18:12 BoogieIcfgContainer [2019-12-26 23:18:12,324 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:18:12,326 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:18:12,326 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:18:12,329 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:18:12,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:18:10" (1/3) ... [2019-12-26 23:18:12,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25d329a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:18:12, skipping insertion in model container [2019-12-26 23:18:12,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:18:11" (2/3) ... [2019-12-26 23:18:12,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25d329a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:18:12, skipping insertion in model container [2019-12-26 23:18:12,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:18:12" (3/3) ... [2019-12-26 23:18:12,334 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi007_power.opt.i [2019-12-26 23:18:12,344 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:18:12,345 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:18:12,353 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:18:12,354 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:18:12,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,393 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,393 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,393 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,394 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,394 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,404 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,404 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,453 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,453 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,454 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,459 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,462 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:12,478 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-26 23:18:12,496 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:18:12,497 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:18:12,497 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:18:12,497 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:18:12,497 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:18:12,497 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:18:12,497 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:18:12,497 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:18:12,514 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-26 23:18:12,516 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-26 23:18:12,605 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-26 23:18:12,605 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:18:12,620 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-26 23:18:12,642 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-26 23:18:12,725 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-26 23:18:12,725 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:18:12,735 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-26 23:18:12,753 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-26 23:18:12,754 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:18:17,818 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-26 23:18:17,924 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-26 23:18:18,290 INFO L206 etLargeBlockEncoding]: Checked pairs total: 76691 [2019-12-26 23:18:18,290 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-12-26 23:18:18,294 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 90 transitions [2019-12-26 23:18:18,834 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9438 states. [2019-12-26 23:18:18,836 INFO L276 IsEmpty]: Start isEmpty. Operand 9438 states. [2019-12-26 23:18:18,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 23:18:18,844 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:18:18,845 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 23:18:18,845 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:18:18,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:18:18,852 INFO L82 PathProgramCache]: Analyzing trace with hash 790297, now seen corresponding path program 1 times [2019-12-26 23:18:18,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:18:18,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761900727] [2019-12-26 23:18:18,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:18:19,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:18:19,087 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 23:18:19,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761900727] [2019-12-26 23:18:19,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:18:19,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:18:19,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23690354] [2019-12-26 23:18:19,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:18:19,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:18:19,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:18:19,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:18:19,113 INFO L87 Difference]: Start difference. First operand 9438 states. Second operand 3 states. [2019-12-26 23:18:19,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:18:19,370 INFO L93 Difference]: Finished difference Result 9266 states and 29920 transitions. [2019-12-26 23:18:19,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:18:19,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 23:18:19,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:18:19,457 INFO L225 Difference]: With dead ends: 9266 [2019-12-26 23:18:19,457 INFO L226 Difference]: Without dead ends: 8258 [2019-12-26 23:18:19,459 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 23:18:19,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8258 states. [2019-12-26 23:18:19,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8258 to 8258. [2019-12-26 23:18:19,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8258 states. [2019-12-26 23:18:20,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8258 states to 8258 states and 26572 transitions. [2019-12-26 23:18:20,014 INFO L78 Accepts]: Start accepts. Automaton has 8258 states and 26572 transitions. Word has length 3 [2019-12-26 23:18:20,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:18:20,015 INFO L462 AbstractCegarLoop]: Abstraction has 8258 states and 26572 transitions. [2019-12-26 23:18:20,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:18:20,015 INFO L276 IsEmpty]: Start isEmpty. Operand 8258 states and 26572 transitions. [2019-12-26 23:18:20,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:18:20,018 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:18:20,018 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:18:20,019 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:18:20,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:18:20,019 INFO L82 PathProgramCache]: Analyzing trace with hash 316025548, now seen corresponding path program 1 times [2019-12-26 23:18:20,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:18:20,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957515531] [2019-12-26 23:18:20,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:18:20,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:18:20,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:18:20,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957515531] [2019-12-26 23:18:20,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:18:20,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:18:20,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742828586] [2019-12-26 23:18:20,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:18:20,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:18:20,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:18:20,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:18:20,152 INFO L87 Difference]: Start difference. First operand 8258 states and 26572 transitions. Second operand 4 states. [2019-12-26 23:18:20,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:18:20,241 INFO L93 Difference]: Finished difference Result 1877 states and 4722 transitions. [2019-12-26 23:18:20,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:18:20,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 23:18:20,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:18:20,249 INFO L225 Difference]: With dead ends: 1877 [2019-12-26 23:18:20,249 INFO L226 Difference]: Without dead ends: 1373 [2019-12-26 23:18:20,252 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 23:18:20,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2019-12-26 23:18:20,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 1373. [2019-12-26 23:18:20,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1373 states. [2019-12-26 23:18:20,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 3108 transitions. [2019-12-26 23:18:20,295 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 3108 transitions. Word has length 11 [2019-12-26 23:18:20,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:18:20,295 INFO L462 AbstractCegarLoop]: Abstraction has 1373 states and 3108 transitions. [2019-12-26 23:18:20,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:18:20,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 3108 transitions. [2019-12-26 23:18:20,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 23:18:20,302 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:18:20,302 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:18:20,303 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:18:20,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:18:20,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1209477957, now seen corresponding path program 1 times [2019-12-26 23:18:20,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:18:20,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205372212] [2019-12-26 23:18:20,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:18:20,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:18:20,468 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 23:18:20,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205372212] [2019-12-26 23:18:20,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:18:20,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:18:20,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861460859] [2019-12-26 23:18:20,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:18:20,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:18:20,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:18:20,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:18:20,471 INFO L87 Difference]: Start difference. First operand 1373 states and 3108 transitions. Second operand 4 states. [2019-12-26 23:18:20,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:18:20,676 INFO L93 Difference]: Finished difference Result 1700 states and 3783 transitions. [2019-12-26 23:18:20,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:18:20,677 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-26 23:18:20,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:18:20,687 INFO L225 Difference]: With dead ends: 1700 [2019-12-26 23:18:20,687 INFO L226 Difference]: Without dead ends: 1700 [2019-12-26 23:18:20,688 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 23:18:20,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states. [2019-12-26 23:18:20,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 1636. [2019-12-26 23:18:20,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1636 states. [2019-12-26 23:18:20,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 3659 transitions. [2019-12-26 23:18:20,728 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 3659 transitions. Word has length 14 [2019-12-26 23:18:20,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:18:20,729 INFO L462 AbstractCegarLoop]: Abstraction has 1636 states and 3659 transitions. [2019-12-26 23:18:20,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:18:20,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 3659 transitions. [2019-12-26 23:18:20,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 23:18:20,732 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:18:20,732 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 23:18:20,733 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:18:20,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:18:20,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1133745070, now seen corresponding path program 1 times [2019-12-26 23:18:20,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:18:20,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800260545] [2019-12-26 23:18:20,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:18:20,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:18:20,976 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 23:18:20,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800260545] [2019-12-26 23:18:20,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:18:20,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:18:20,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593554804] [2019-12-26 23:18:20,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:18:20,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:18:20,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:18:20,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:18:20,979 INFO L87 Difference]: Start difference. First operand 1636 states and 3659 transitions. Second operand 6 states. [2019-12-26 23:18:21,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:18:21,772 INFO L93 Difference]: Finished difference Result 4529 states and 10000 transitions. [2019-12-26 23:18:21,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 23:18:21,772 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-26 23:18:21,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:18:21,796 INFO L225 Difference]: With dead ends: 4529 [2019-12-26 23:18:21,796 INFO L226 Difference]: Without dead ends: 4494 [2019-12-26 23:18:21,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-26 23:18:21,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4494 states. [2019-12-26 23:18:21,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4494 to 2196. [2019-12-26 23:18:21,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2196 states. [2019-12-26 23:18:21,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2196 states to 2196 states and 4963 transitions. [2019-12-26 23:18:21,872 INFO L78 Accepts]: Start accepts. Automaton has 2196 states and 4963 transitions. Word has length 25 [2019-12-26 23:18:21,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:18:21,872 INFO L462 AbstractCegarLoop]: Abstraction has 2196 states and 4963 transitions. [2019-12-26 23:18:21,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:18:21,872 INFO L276 IsEmpty]: Start isEmpty. Operand 2196 states and 4963 transitions. [2019-12-26 23:18:21,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-26 23:18:21,875 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:18:21,875 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:18:21,876 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:18:21,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:18:21,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1415860500, now seen corresponding path program 1 times [2019-12-26 23:18:21,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:18:21,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737375228] [2019-12-26 23:18:21,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:18:21,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:18:21,929 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 23:18:21,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737375228] [2019-12-26 23:18:21,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:18:21,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:18:21,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887272587] [2019-12-26 23:18:21,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:18:21,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:18:21,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:18:21,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:18:21,931 INFO L87 Difference]: Start difference. First operand 2196 states and 4963 transitions. Second operand 3 states. [2019-12-26 23:18:21,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:18:21,944 INFO L93 Difference]: Finished difference Result 2195 states and 4961 transitions. [2019-12-26 23:18:21,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:18:21,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-26 23:18:21,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:18:21,956 INFO L225 Difference]: With dead ends: 2195 [2019-12-26 23:18:21,956 INFO L226 Difference]: Without dead ends: 2195 [2019-12-26 23:18:21,957 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 23:18:21,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2195 states. [2019-12-26 23:18:21,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2195 to 2195. [2019-12-26 23:18:21,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2195 states. [2019-12-26 23:18:22,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2195 states to 2195 states and 4961 transitions. [2019-12-26 23:18:22,003 INFO L78 Accepts]: Start accepts. Automaton has 2195 states and 4961 transitions. Word has length 26 [2019-12-26 23:18:22,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:18:22,004 INFO L462 AbstractCegarLoop]: Abstraction has 2195 states and 4961 transitions. [2019-12-26 23:18:22,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:18:22,004 INFO L276 IsEmpty]: Start isEmpty. Operand 2195 states and 4961 transitions. [2019-12-26 23:18:22,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-26 23:18:22,007 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:18:22,007 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:18:22,007 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:18:22,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:18:22,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1963896570, now seen corresponding path program 1 times [2019-12-26 23:18:22,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:18:22,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025512442] [2019-12-26 23:18:22,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:18:22,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:18:22,101 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 23:18:22,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025512442] [2019-12-26 23:18:22,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:18:22,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:18:22,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833549068] [2019-12-26 23:18:22,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:18:22,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:18:22,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:18:22,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:18:22,103 INFO L87 Difference]: Start difference. First operand 2195 states and 4961 transitions. Second operand 6 states. [2019-12-26 23:18:22,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:18:22,775 INFO L93 Difference]: Finished difference Result 4412 states and 9625 transitions. [2019-12-26 23:18:22,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 23:18:22,775 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-26 23:18:22,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:18:22,787 INFO L225 Difference]: With dead ends: 4412 [2019-12-26 23:18:22,787 INFO L226 Difference]: Without dead ends: 4383 [2019-12-26 23:18:22,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-26 23:18:22,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4383 states. [2019-12-26 23:18:22,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4383 to 2070. [2019-12-26 23:18:22,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2070 states. [2019-12-26 23:18:22,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2070 states to 2070 states and 4705 transitions. [2019-12-26 23:18:22,938 INFO L78 Accepts]: Start accepts. Automaton has 2070 states and 4705 transitions. Word has length 26 [2019-12-26 23:18:22,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:18:22,938 INFO L462 AbstractCegarLoop]: Abstraction has 2070 states and 4705 transitions. [2019-12-26 23:18:22,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:18:22,939 INFO L276 IsEmpty]: Start isEmpty. Operand 2070 states and 4705 transitions. [2019-12-26 23:18:22,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 23:18:22,941 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:18:22,941 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:18:22,942 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:18:22,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:18:22,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1827812304, now seen corresponding path program 1 times [2019-12-26 23:18:22,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:18:22,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257382377] [2019-12-26 23:18:22,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:18:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:18:23,042 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 23:18:23,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257382377] [2019-12-26 23:18:23,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:18:23,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:18:23,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785751816] [2019-12-26 23:18:23,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:18:23,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:18:23,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:18:23,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:18:23,044 INFO L87 Difference]: Start difference. First operand 2070 states and 4705 transitions. Second operand 5 states. [2019-12-26 23:18:23,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:18:23,535 INFO L93 Difference]: Finished difference Result 3102 states and 6886 transitions. [2019-12-26 23:18:23,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:18:23,536 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-26 23:18:23,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:18:23,544 INFO L225 Difference]: With dead ends: 3102 [2019-12-26 23:18:23,545 INFO L226 Difference]: Without dead ends: 3102 [2019-12-26 23:18:23,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:18:23,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3102 states. [2019-12-26 23:18:23,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3102 to 2654. [2019-12-26 23:18:23,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2654 states. [2019-12-26 23:18:23,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2654 states to 2654 states and 5970 transitions. [2019-12-26 23:18:23,602 INFO L78 Accepts]: Start accepts. Automaton has 2654 states and 5970 transitions. Word has length 27 [2019-12-26 23:18:23,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:18:23,603 INFO L462 AbstractCegarLoop]: Abstraction has 2654 states and 5970 transitions. [2019-12-26 23:18:23,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:18:23,603 INFO L276 IsEmpty]: Start isEmpty. Operand 2654 states and 5970 transitions. [2019-12-26 23:18:23,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 23:18:23,607 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:18:23,607 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:18:23,607 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:18:23,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:18:23,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1234551102, now seen corresponding path program 1 times [2019-12-26 23:18:23,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:18:23,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014172918] [2019-12-26 23:18:23,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:18:23,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:18:23,682 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 23:18:23,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014172918] [2019-12-26 23:18:23,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:18:23,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:18:23,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819209278] [2019-12-26 23:18:23,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:18:23,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:18:23,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:18:23,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:18:23,684 INFO L87 Difference]: Start difference. First operand 2654 states and 5970 transitions. Second operand 5 states. [2019-12-26 23:18:23,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:18:23,728 INFO L93 Difference]: Finished difference Result 1623 states and 3504 transitions. [2019-12-26 23:18:23,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:18:23,729 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-26 23:18:23,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:18:23,733 INFO L225 Difference]: With dead ends: 1623 [2019-12-26 23:18:23,734 INFO L226 Difference]: Without dead ends: 1475 [2019-12-26 23:18:23,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:18:23,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2019-12-26 23:18:23,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 1374. [2019-12-26 23:18:23,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1374 states. [2019-12-26 23:18:23,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 2999 transitions. [2019-12-26 23:18:23,763 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 2999 transitions. Word has length 28 [2019-12-26 23:18:23,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:18:23,763 INFO L462 AbstractCegarLoop]: Abstraction has 1374 states and 2999 transitions. [2019-12-26 23:18:23,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:18:23,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 2999 transitions. [2019-12-26 23:18:23,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-26 23:18:23,768 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:18:23,768 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:18:23,768 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:18:23,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:18:23,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1528690992, now seen corresponding path program 1 times [2019-12-26 23:18:23,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:18:23,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028196531] [2019-12-26 23:18:23,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:18:23,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:18:23,858 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 23:18:23,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028196531] [2019-12-26 23:18:23,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:18:23,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:18:23,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139650875] [2019-12-26 23:18:23,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:18:23,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:18:23,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:18:23,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:18:23,861 INFO L87 Difference]: Start difference. First operand 1374 states and 2999 transitions. Second operand 7 states. [2019-12-26 23:18:24,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:18:24,162 INFO L93 Difference]: Finished difference Result 4064 states and 8639 transitions. [2019-12-26 23:18:24,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 23:18:24,162 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-26 23:18:24,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:18:24,170 INFO L225 Difference]: With dead ends: 4064 [2019-12-26 23:18:24,170 INFO L226 Difference]: Without dead ends: 2676 [2019-12-26 23:18:24,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-26 23:18:24,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2676 states. [2019-12-26 23:18:24,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2676 to 1440. [2019-12-26 23:18:24,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1440 states. [2019-12-26 23:18:24,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1440 states and 3133 transitions. [2019-12-26 23:18:24,212 INFO L78 Accepts]: Start accepts. Automaton has 1440 states and 3133 transitions. Word has length 51 [2019-12-26 23:18:24,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:18:24,213 INFO L462 AbstractCegarLoop]: Abstraction has 1440 states and 3133 transitions. [2019-12-26 23:18:24,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:18:24,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 3133 transitions. [2019-12-26 23:18:24,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-26 23:18:24,219 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:18:24,219 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:18:24,220 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:18:24,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:18:24,220 INFO L82 PathProgramCache]: Analyzing trace with hash 517037056, now seen corresponding path program 2 times [2019-12-26 23:18:24,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:18:24,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532372939] [2019-12-26 23:18:24,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:18:24,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:18:24,344 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 23:18:24,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532372939] [2019-12-26 23:18:24,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:18:24,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:18:24,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353661973] [2019-12-26 23:18:24,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:18:24,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:18:24,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:18:24,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:18:24,346 INFO L87 Difference]: Start difference. First operand 1440 states and 3133 transitions. Second operand 3 states. [2019-12-26 23:18:24,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:18:24,414 INFO L93 Difference]: Finished difference Result 1866 states and 4011 transitions. [2019-12-26 23:18:24,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:18:24,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-26 23:18:24,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:18:24,418 INFO L225 Difference]: With dead ends: 1866 [2019-12-26 23:18:24,418 INFO L226 Difference]: Without dead ends: 1866 [2019-12-26 23:18:24,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:18:24,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866 states. [2019-12-26 23:18:24,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866 to 1519. [2019-12-26 23:18:24,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1519 states. [2019-12-26 23:18:24,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1519 states to 1519 states and 3317 transitions. [2019-12-26 23:18:24,456 INFO L78 Accepts]: Start accepts. Automaton has 1519 states and 3317 transitions. Word has length 51 [2019-12-26 23:18:24,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:18:24,457 INFO L462 AbstractCegarLoop]: Abstraction has 1519 states and 3317 transitions. [2019-12-26 23:18:24,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:18:24,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 3317 transitions. [2019-12-26 23:18:24,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 23:18:24,461 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:18:24,462 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:18:24,462 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:18:24,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:18:24,462 INFO L82 PathProgramCache]: Analyzing trace with hash -975275625, now seen corresponding path program 1 times [2019-12-26 23:18:24,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:18:24,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744149261] [2019-12-26 23:18:24,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:18:24,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:18:24,683 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 23:18:24,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744149261] [2019-12-26 23:18:24,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:18:24,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:18:24,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844853845] [2019-12-26 23:18:24,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 23:18:24,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:18:24,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 23:18:24,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:18:24,686 INFO L87 Difference]: Start difference. First operand 1519 states and 3317 transitions. Second operand 8 states. [2019-12-26 23:18:26,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:18:26,214 INFO L93 Difference]: Finished difference Result 3210 states and 6767 transitions. [2019-12-26 23:18:26,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-26 23:18:26,214 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-12-26 23:18:26,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:18:26,222 INFO L225 Difference]: With dead ends: 3210 [2019-12-26 23:18:26,222 INFO L226 Difference]: Without dead ends: 3210 [2019-12-26 23:18:26,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=592, Unknown=0, NotChecked=0, Total=756 [2019-12-26 23:18:26,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3210 states. [2019-12-26 23:18:26,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3210 to 1557. [2019-12-26 23:18:26,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1557 states. [2019-12-26 23:18:26,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 3381 transitions. [2019-12-26 23:18:26,265 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 3381 transitions. Word has length 52 [2019-12-26 23:18:26,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:18:26,265 INFO L462 AbstractCegarLoop]: Abstraction has 1557 states and 3381 transitions. [2019-12-26 23:18:26,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 23:18:26,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 3381 transitions. [2019-12-26 23:18:26,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 23:18:26,269 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:18:26,269 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:18:26,270 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:18:26,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:18:26,270 INFO L82 PathProgramCache]: Analyzing trace with hash -709931818, now seen corresponding path program 1 times [2019-12-26 23:18:26,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:18:26,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634682368] [2019-12-26 23:18:26,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:18:26,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:18:26,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:18:26,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634682368] [2019-12-26 23:18:26,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:18:26,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:18:26,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312016156] [2019-12-26 23:18:26,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:18:26,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:18:26,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:18:26,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:18:26,400 INFO L87 Difference]: Start difference. First operand 1557 states and 3381 transitions. Second operand 7 states. [2019-12-26 23:18:27,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:18:27,568 INFO L93 Difference]: Finished difference Result 2962 states and 6177 transitions. [2019-12-26 23:18:27,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 23:18:27,569 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-26 23:18:27,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:18:27,574 INFO L225 Difference]: With dead ends: 2962 [2019-12-26 23:18:27,574 INFO L226 Difference]: Without dead ends: 2962 [2019-12-26 23:18:27,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2019-12-26 23:18:27,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2962 states. [2019-12-26 23:18:27,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2962 to 1592. [2019-12-26 23:18:27,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1592 states. [2019-12-26 23:18:27,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1592 states and 3462 transitions. [2019-12-26 23:18:27,615 INFO L78 Accepts]: Start accepts. Automaton has 1592 states and 3462 transitions. Word has length 52 [2019-12-26 23:18:27,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:18:27,615 INFO L462 AbstractCegarLoop]: Abstraction has 1592 states and 3462 transitions. [2019-12-26 23:18:27,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:18:27,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 3462 transitions. [2019-12-26 23:18:27,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 23:18:27,620 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:18:27,620 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:18:27,620 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:18:27,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:18:27,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1725495463, now seen corresponding path program 2 times [2019-12-26 23:18:27,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:18:27,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407566952] [2019-12-26 23:18:27,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:18:27,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:18:27,705 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 23:18:27,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407566952] [2019-12-26 23:18:27,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:18:27,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:18:27,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025484932] [2019-12-26 23:18:27,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:18:27,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:18:27,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:18:27,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:18:27,708 INFO L87 Difference]: Start difference. First operand 1592 states and 3462 transitions. Second operand 3 states. [2019-12-26 23:18:27,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:18:27,724 INFO L93 Difference]: Finished difference Result 1591 states and 3460 transitions. [2019-12-26 23:18:27,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:18:27,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-26 23:18:27,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:18:27,728 INFO L225 Difference]: With dead ends: 1591 [2019-12-26 23:18:27,729 INFO L226 Difference]: Without dead ends: 1591 [2019-12-26 23:18:27,729 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 23:18:27,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2019-12-26 23:18:27,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 1125. [2019-12-26 23:18:27,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1125 states. [2019-12-26 23:18:27,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 2488 transitions. [2019-12-26 23:18:27,752 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 2488 transitions. Word has length 52 [2019-12-26 23:18:27,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:18:27,752 INFO L462 AbstractCegarLoop]: Abstraction has 1125 states and 2488 transitions. [2019-12-26 23:18:27,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:18:27,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 2488 transitions. [2019-12-26 23:18:27,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-26 23:18:27,755 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:18:27,756 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] [2019-12-26 23:18:27,756 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:18:27,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:18:27,756 INFO L82 PathProgramCache]: Analyzing trace with hash 238171223, now seen corresponding path program 1 times [2019-12-26 23:18:27,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:18:27,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087985456] [2019-12-26 23:18:27,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:18:27,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:18:27,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:18:27,887 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:18:27,887 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:18:27,891 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= v_~main$tmp_guard0~0_31 0) (= v_~x$r_buff1_thd1~0_165 0) (= 0 v_~x~0_148) (= v_~x$r_buff0_thd0~0_133 0) (= v_~x$r_buff0_thd1~0_227 0) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t1707~0.base_24| 1)) (= v_~weak$$choice2~0_120 0) (= |v_#NULL.offset_6| 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1707~0.base_24| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1707~0.base_24| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1707~0.base_24|) |v_ULTIMATE.start_main_~#t1707~0.offset_18| 0)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t1707~0.offset_18|) (= v_~__unbuffered_p1_EBX~0_40 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1707~0.base_24|) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_cnt~0_63) (= v_~main$tmp_guard1~0_41 0) (= v_~y~0_147 0) (= 0 |v_#NULL.base_6|) (= v_~x$flush_delayed~0_31 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_24 0) (= 0 v_~x$w_buff1_used~0_507) (= 0 v_~weak$$choice0~0_22) (= v_~x$r_buff1_thd0~0_183 0) (= 0 v_~x$w_buff1~0_317) (= 0 v_~x$w_buff0~0_542) (= 0 v_~x$r_buff0_thd2~0_359) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1707~0.base_24|)) (= 0 v_~x$w_buff0_used~0_792) (= 0 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~x$r_buff1_thd2~0_331) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_542, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_227, ~x$flush_delayed~0=v_~x$flush_delayed~0_31, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_165, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ULTIMATE.start_main_~#t1708~0.offset=|v_ULTIMATE.start_main_~#t1708~0.offset_14|, ~x$mem_tmp~0=v_~x$mem_tmp~0_24, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_28|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_69|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_34|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_~#t1708~0.base=|v_ULTIMATE.start_main_~#t1708~0.base_16|, #length=|v_#length_13|, ~y~0=v_~y~0_147, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_133, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_317, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_507, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_331, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, ULTIMATE.start_main_~#t1707~0.base=|v_ULTIMATE.start_main_~#t1707~0.base_24|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_183, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_359, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_792, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ULTIMATE.start_main_~#t1707~0.offset=|v_ULTIMATE.start_main_~#t1707~0.offset_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~weak$$choice2~0=v_~weak$$choice2~0_120, ~x~0=v_~x~0_148, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t1708~0.offset, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1708~0.base, #length, ~y~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1707~0.base, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1707~0.offset, ULTIMATE.start_main_#t~ite40, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-26 23:18:27,892 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L4-->L738: Formula: (and (= 1 v_~x$r_buff0_thd1~0_40) (= v_~x$r_buff1_thd1~0_23 v_~x$r_buff0_thd1~0_41) (= v_~x$r_buff1_thd2~0_64 v_~x$r_buff0_thd2~0_110) (= v_~y~0_18 1) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_74 0)) (= v_~x$r_buff1_thd0~0_37 v_~x$r_buff0_thd0~0_53)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_74, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_74, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_64, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_23, ~y~0=v_~y~0_18, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_37} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-26 23:18:27,893 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L797-1-->L799: Formula: (and (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1708~0.base_12|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1708~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1708~0.base_12|) |v_ULTIMATE.start_main_~#t1708~0.offset_10| 1))) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1708~0.base_12| 4) |v_#length_9|) (= 0 |v_ULTIMATE.start_main_~#t1708~0.offset_10|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1708~0.base_12|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1708~0.base_12| 1) |v_#valid_27|) (not (= 0 |v_ULTIMATE.start_main_~#t1708~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1708~0.base=|v_ULTIMATE.start_main_~#t1708~0.base_12|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1708~0.offset=|v_ULTIMATE.start_main_~#t1708~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1708~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1708~0.offset] because there is no mapped edge [2019-12-26 23:18:27,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L739-->L739-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In2118296598 256))) (.cse1 (= (mod ~x$r_buff0_thd1~0_In2118296598 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out2118296598| 0) (not .cse1)) (and (= ~x$w_buff0_used~0_In2118296598 |P0Thread1of1ForFork0_#t~ite5_Out2118296598|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2118296598, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2118296598} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out2118296598|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2118296598, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2118296598} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 23:18:27,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In489230866 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_In489230866| |P1Thread1of1ForFork1_#t~ite14_Out489230866|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite15_Out489230866| ~x$w_buff0~0_In489230866)) (and .cse0 (= ~x$w_buff0~0_In489230866 |P1Thread1of1ForFork1_#t~ite14_Out489230866|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In489230866 256)))) (or (and (= 0 (mod ~x$w_buff1_used~0_In489230866 256)) .cse1) (and .cse1 (= (mod ~x$r_buff1_thd2~0_In489230866 256) 0)) (= (mod ~x$w_buff0_used~0_In489230866 256) 0))) (= |P1Thread1of1ForFork1_#t~ite15_Out489230866| |P1Thread1of1ForFork1_#t~ite14_Out489230866|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In489230866, ~x$w_buff1_used~0=~x$w_buff1_used~0_In489230866, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In489230866, ~weak$$choice2~0=~weak$$choice2~0_In489230866, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In489230866, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In489230866|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In489230866} OutVars{~x$w_buff0~0=~x$w_buff0~0_In489230866, ~x$w_buff1_used~0=~x$w_buff1_used~0_In489230866, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In489230866, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out489230866|, ~weak$$choice2~0=~weak$$choice2~0_In489230866, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In489230866, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out489230866|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In489230866} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-26 23:18:27,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L740-->L740-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In1387530198 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1387530198 256))) (.cse0 (= (mod ~x$r_buff1_thd1~0_In1387530198 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1387530198 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out1387530198| ~x$w_buff1_used~0_In1387530198)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out1387530198| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1387530198, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1387530198, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1387530198, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1387530198} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1387530198|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1387530198, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1387530198, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1387530198, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1387530198} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 23:18:27,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1928767434 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1928767434 256)))) (or (and (= ~x$r_buff0_thd1~0_In-1928767434 ~x$r_buff0_thd1~0_Out-1928767434) (or .cse0 .cse1)) (and (= ~x$r_buff0_thd1~0_Out-1928767434 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1928767434, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1928767434} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-1928767434, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1928767434|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1928767434} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-26 23:18:27,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L742-->L742-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In140062380 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In140062380 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd1~0_In140062380 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In140062380 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd1~0_In140062380 |P0Thread1of1ForFork0_#t~ite8_Out140062380|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out140062380|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In140062380, ~x$w_buff1_used~0=~x$w_buff1_used~0_In140062380, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In140062380, ~x$w_buff0_used~0=~x$w_buff0_used~0_In140062380} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In140062380, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out140062380|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In140062380, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In140062380, ~x$w_buff0_used~0=~x$w_buff0_used~0_In140062380} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 23:18:27,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L742-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd1~0_128 |v_P0Thread1of1ForFork0_#t~ite8_32|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_31|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_128} 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 23:18:27,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L764-->L764-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1936383275 256) 0))) (or (and .cse0 (= ~x$w_buff1~0_In-1936383275 |P1Thread1of1ForFork1_#t~ite17_Out-1936383275|) (= |P1Thread1of1ForFork1_#t~ite18_Out-1936383275| |P1Thread1of1ForFork1_#t~ite17_Out-1936383275|) (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-1936383275 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In-1936383275 256)) (and .cse1 (= (mod ~x$r_buff1_thd2~0_In-1936383275 256) 0)) (and .cse1 (= (mod ~x$w_buff1_used~0_In-1936383275 256) 0))))) (and (= |P1Thread1of1ForFork1_#t~ite17_In-1936383275| |P1Thread1of1ForFork1_#t~ite17_Out-1936383275|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite18_Out-1936383275| ~x$w_buff1~0_In-1936383275)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1936383275, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1936383275, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1936383275, ~weak$$choice2~0=~weak$$choice2~0_In-1936383275, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1936383275, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In-1936383275|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1936383275} OutVars{P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out-1936383275|, ~x$w_buff1~0=~x$w_buff1~0_In-1936383275, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1936383275, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1936383275, ~weak$$choice2~0=~weak$$choice2~0_In-1936383275, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1936383275, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out-1936383275|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1936383275} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-26 23:18:27,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-805183987 256) 0))) (or (and (= ~x$w_buff0_used~0_In-805183987 |P1Thread1of1ForFork1_#t~ite21_Out-805183987|) (= |P1Thread1of1ForFork1_#t~ite20_In-805183987| |P1Thread1of1ForFork1_#t~ite20_Out-805183987|) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-805183987 256)))) (or (and (= 0 (mod ~x$r_buff1_thd2~0_In-805183987 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In-805183987 256)) (and .cse1 (= (mod ~x$w_buff1_used~0_In-805183987 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite20_Out-805183987| ~x$w_buff0_used~0_In-805183987) .cse0 (= |P1Thread1of1ForFork1_#t~ite20_Out-805183987| |P1Thread1of1ForFork1_#t~ite21_Out-805183987|)))) InVars {P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-805183987|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-805183987, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-805183987, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-805183987, ~weak$$choice2~0=~weak$$choice2~0_In-805183987, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-805183987} OutVars{P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-805183987|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-805183987, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-805183987, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-805183987|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-805183987, ~weak$$choice2~0=~weak$$choice2~0_In-805183987, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-805183987} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-26 23:18:27,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~x$r_buff0_thd2~0_135 v_~x$r_buff0_thd2~0_134)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_27, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_14|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_11|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-26 23:18:27,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L768-->L768-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1943944352 256)))) (or (and (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1943944352 256)))) (or (and .cse0 (= 0 (mod ~x$w_buff1_used~0_In1943944352 256))) (= 0 (mod ~x$w_buff0_used~0_In1943944352 256)) (and .cse0 (= (mod ~x$r_buff1_thd2~0_In1943944352 256) 0)))) (= ~x$r_buff1_thd2~0_In1943944352 |P1Thread1of1ForFork1_#t~ite29_Out1943944352|) .cse1 (= |P1Thread1of1ForFork1_#t~ite30_Out1943944352| |P1Thread1of1ForFork1_#t~ite29_Out1943944352|)) (and (= |P1Thread1of1ForFork1_#t~ite29_In1943944352| |P1Thread1of1ForFork1_#t~ite29_Out1943944352|) (= ~x$r_buff1_thd2~0_In1943944352 |P1Thread1of1ForFork1_#t~ite30_Out1943944352|) (not .cse1)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1943944352|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1943944352, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1943944352, ~weak$$choice2~0=~weak$$choice2~0_In1943944352, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1943944352, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1943944352} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1943944352|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1943944352|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1943944352, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1943944352, ~weak$$choice2~0=~weak$$choice2~0_In1943944352, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1943944352, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1943944352} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-26 23:18:27,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L770-->L774: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_5 v_~x~0_14)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_7, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31, ~x~0] because there is no mapped edge [2019-12-26 23:18:27,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L774-2-->L774-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In1688576913 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1688576913 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out1688576913| ~x~0_In1688576913)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out1688576913| ~x$w_buff1~0_In1688576913) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1688576913, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1688576913, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1688576913, ~x~0=~x~0_In1688576913} OutVars{~x$w_buff1~0=~x$w_buff1~0_In1688576913, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1688576913, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1688576913, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1688576913|, ~x~0=~x~0_In1688576913} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-26 23:18:27,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L774-4-->L775: Formula: (= v_~x~0_29 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-26 23:18:27,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1433880945 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-1433880945 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out-1433880945| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In-1433880945 |P1Thread1of1ForFork1_#t~ite34_Out-1433880945|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1433880945, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1433880945} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1433880945|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1433880945, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1433880945} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-26 23:18:27,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In284400908 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In284400908 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In284400908 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In284400908 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite35_Out284400908| ~x$w_buff1_used~0_In284400908)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out284400908| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In284400908, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In284400908, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In284400908, ~x$w_buff0_used~0=~x$w_buff0_used~0_In284400908} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In284400908, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In284400908, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out284400908|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In284400908, ~x$w_buff0_used~0=~x$w_buff0_used~0_In284400908} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-26 23:18:27,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-266804333 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-266804333 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out-266804333| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out-266804333| ~x$r_buff0_thd2~0_In-266804333) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-266804333, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-266804333} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-266804333, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-266804333|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-266804333} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-26 23:18:27,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L778-->L778-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd2~0_In283912033 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In283912033 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In283912033 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In283912033 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out283912033|)) (and (= ~x$r_buff1_thd2~0_In283912033 |P1Thread1of1ForFork1_#t~ite37_Out283912033|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In283912033, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In283912033, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In283912033, ~x$w_buff0_used~0=~x$w_buff0_used~0_In283912033} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In283912033, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In283912033, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In283912033, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out283912033|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In283912033} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-26 23:18:27,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_269 |v_P1Thread1of1ForFork1_#t~ite37_42|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_42|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_269, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_41|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-26 23:18:27,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= 0 (mod v_~x$r_buff0_thd0~0_64 256)) (= (mod v_~x$w_buff0_used~0_301 256) 0)) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-26 23:18:27,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-1489253272 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-1489253272 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In-1489253272 |ULTIMATE.start_main_#t~ite40_Out-1489253272|)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-1489253272| ~x~0_In-1489253272)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1489253272, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1489253272, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1489253272, ~x~0=~x~0_In-1489253272} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1489253272|, ~x$w_buff1~0=~x$w_buff1~0_In-1489253272, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1489253272, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1489253272, ~x~0=~x~0_In-1489253272} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-26 23:18:27,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L805-4-->L806: Formula: (= v_~x~0_46 |v_ULTIMATE.start_main_#t~ite40_13|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~x~0=v_~x~0_46} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x~0] because there is no mapped edge [2019-12-26 23:18:27,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L806-->L806-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1728732402 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1728732402 256)))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out1728732402| ~x$w_buff0_used~0_In1728732402) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite42_Out1728732402| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1728732402, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1728732402} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1728732402, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1728732402|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1728732402} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-26 23:18:27,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L807-->L807-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In137700838 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In137700838 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In137700838 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In137700838 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In137700838 |ULTIMATE.start_main_#t~ite43_Out137700838|)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out137700838|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In137700838, ~x$w_buff1_used~0=~x$w_buff1_used~0_In137700838, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In137700838, ~x$w_buff0_used~0=~x$w_buff0_used~0_In137700838} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In137700838, ~x$w_buff1_used~0=~x$w_buff1_used~0_In137700838, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out137700838|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In137700838, ~x$w_buff0_used~0=~x$w_buff0_used~0_In137700838} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-26 23:18:27,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In878697972 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In878697972 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In878697972 |ULTIMATE.start_main_#t~ite44_Out878697972|)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out878697972| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In878697972, ~x$w_buff0_used~0=~x$w_buff0_used~0_In878697972} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In878697972, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out878697972|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In878697972} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-26 23:18:27,906 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L809-->L809-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1540773197 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1540773197 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1540773197 256))) (.cse3 (= (mod ~x$r_buff1_thd0~0_In1540773197 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out1540773197| ~x$r_buff1_thd0~0_In1540773197) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out1540773197| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1540773197, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1540773197, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1540773197, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1540773197} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1540773197, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1540773197, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1540773197, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1540773197|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1540773197} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-26 23:18:27,906 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p1_EBX~0_27 0) (= v_~main$tmp_guard1~0_20 0) (= v_~y~0_126 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= 2 v_~__unbuffered_p1_EAX~0_27) (= v_~x$r_buff1_thd0~0_149 |v_ULTIMATE.start_main_#t~ite45_40|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~y~0=v_~y~0_126, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~y~0=v_~y~0_126, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_149, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 23:18:27,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:18:27 BasicIcfg [2019-12-26 23:18:27,966 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:18:27,967 INFO L168 Benchmark]: Toolchain (without parser) took 17368.99 ms. Allocated memory was 146.3 MB in the beginning and 497.5 MB in the end (delta: 351.3 MB). Free memory was 101.5 MB in the beginning and 212.0 MB in the end (delta: -110.5 MB). Peak memory consumption was 240.8 MB. Max. memory is 7.1 GB. [2019-12-26 23:18:27,968 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-26 23:18:27,969 INFO L168 Benchmark]: CACSL2BoogieTranslator took 797.77 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 101.1 MB in the beginning and 157.8 MB in the end (delta: -56.8 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. [2019-12-26 23:18:27,970 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.03 ms. Allocated memory is still 204.5 MB. Free memory was 157.8 MB in the beginning and 155.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-26 23:18:27,970 INFO L168 Benchmark]: Boogie Preprocessor took 36.94 ms. Allocated memory is still 204.5 MB. Free memory was 155.1 MB in the beginning and 153.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-26 23:18:27,971 INFO L168 Benchmark]: RCFGBuilder took 806.04 ms. Allocated memory is still 204.5 MB. Free memory was 153.1 MB in the beginning and 109.0 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. [2019-12-26 23:18:27,972 INFO L168 Benchmark]: TraceAbstraction took 15640.11 ms. Allocated memory was 204.5 MB in the beginning and 497.5 MB in the end (delta: 293.1 MB). Free memory was 108.4 MB in the beginning and 212.0 MB in the end (delta: -103.6 MB). Peak memory consumption was 189.4 MB. Max. memory is 7.1 GB. [2019-12-26 23:18:27,976 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 797.77 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 101.1 MB in the beginning and 157.8 MB in the end (delta: -56.8 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 83.03 ms. Allocated memory is still 204.5 MB. Free memory was 157.8 MB in the beginning and 155.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.94 ms. Allocated memory is still 204.5 MB. Free memory was 155.1 MB in the beginning and 153.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 806.04 ms. Allocated memory is still 204.5 MB. Free memory was 153.1 MB in the beginning and 109.0 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15640.11 ms. Allocated memory was 204.5 MB in the beginning and 497.5 MB in the end (delta: 293.1 MB). Free memory was 108.4 MB in the beginning and 212.0 MB in the end (delta: -103.6 MB). Peak memory consumption was 189.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 147 ProgramPointsBefore, 79 ProgramPointsAfterwards, 181 TransitionsBefore, 90 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 12 FixpointIterations, 29 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 26 ChoiceCompositions, 4894 VarBasedMoverChecksPositive, 354 VarBasedMoverChecksNegative, 269 SemBasedMoverChecksPositive, 191 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 76691 CheckedPairsTotal, 108 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t1707, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 1 x$w_buff1 = x$w_buff0 [L725] 1 x$w_buff0 = 1 [L726] 1 x$w_buff1_used = x$w_buff0_used [L727] 1 x$w_buff0_used = (_Bool)1 [L738] 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_p1_EAX=0, __unbuffered_p1_EBX=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=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] FCALL, FORK 0 pthread_create(&t1708, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L752] 2 y = 2 [L755] 2 __unbuffered_p1_EAX = y [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 x$flush_delayed = weak$$choice2 [L761] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 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) [L762] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L763] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L739] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L740] 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 [L764] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L765] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L766] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 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 [L777] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L807] 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 [L808] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 15.3s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1993 SDtfs, 2348 SDslu, 4519 SDs, 0 SdLazy, 3334 SolverSat, 169 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 25 SyntacticMatches, 13 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9438occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 10296 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 471 NumberOfCodeBlocks, 471 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 405 ConstructedInterpolants, 0 QuantifiedInterpolants, 59059 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...